what is eager loading?

1017

ssr function?

2060

Do accountants use microsoft access?

799

How do I change the header on different pages?

573

What are few values provided with sovereignty?

1

explain the key features of Apache Spark?

334

What is mean by forecasting with reference in tableau?

398

Does dba need to know programming?

568

How do I eliminate the blue border around linked images?

800

Explain the difference between check point and output value?

1006

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 }

3187

How do you know your mail server?

3

What is MySAP?

1121

What is operating system and its examples?

997

Tell me what is process definition and what are the attributes does it contain?

974