What is viewdata?

1029

when should I use method get, and when should I use method post in my cgis?

1139

Explain the architecture of the sap bw system?

928

What is relational database with example?

968

Write the significance of electrochemical series? : Electrochemistry Corrosion

991

What n+1 testing is?

1040

Explain sovereign wealth fund.

1112

What are the layers of the osi reference model?

374

What are the different types of upgrades that can be performed in sql server? : sql server DBA

1210

How would you control the size of an element on resize of the window in a component?

799

What is isr?

524

What are the different measures of economic growth?

1076

What is joinpoint?

409

How to achieve polymorphism in c#?

968

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 }

3189