Is class is a abstract datatype in java?

1437

please explain every phase in the "SDLC" in the dotnet.

2165

Do you know what are the new features that iso/ansi c++ has added to original c++ specifications?

546

Why do we need Python Directories

523

How safe is website on wordpress?

103

Where do I find the admin panel on facebook?

78

How can I write a function analogous to scanf?

637

Which programming language's unsatisfactory performance led to the discovery of c++?

783

What are connections In R?

56

Tell me how do you debug a program in python? Is it possible to step through python code?

437

How can variables be characterized?

1624

How to write php code in laravel blade?

391

Which is the best c++ compiler for beginners?

548

You have given 2 array. You need to find whether they will create the same BST or not. For example: Array1:10 5 20 15 30 Array2:10 20 15 30 5 Result: True Array1:10 5 20 15 30 Array2:10 15 20 30 5 Result: False One Approach is Pretty Clear by creating BST O(nlogn) then checking two tree for identical O(N) overall O(nlogn) ..we need there exist O(N) Time & O(1) Space also without extra space .Algorithm ?? DevoCoder guest Posted 3 months ago # #define true 1 #define false 0 int check(int a1[],int a2[],int n1,int n2) { int i; //n1 size of array a1[] and n2 size of a2[] if(n1!=n2) return false; //n1 and n2 must be same for(i=0;ia1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }

2694

Is objective c superset of c?

1