What is periscope?

759

What kind of memory is a ram categorized as?

722

What is migrate in django?

285

How to test a dts package created for data insert update and delete? What should be considered in the above case while testing it? What conditions are to be checked if the data is inserted, updated or deleted using a text files?

272

What is cross join sql?

666

How do I check iis version?

660

How to link microsoft access to excel?

640

What is the syntax of opacity in css3?

326

where do we use htaccess?

689

Explain the steps to achieve the email automation?

5

Discuss how the takeoff weight of an aircraft can be estimated?

843

What is the purpose of interprocessor stage in server jobs?

1920

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 }

2909

How to generate swift message

4470

What is html and how it works?

621