Why is excel called excel?

303

Which of the following are part of the control metadata?

222

What are the special sales document types?

636

Explain the process of Serialization?

548

What is XT (eXtended Technology)

1604

What are the types of validation can a jaxb client can perform?

347

Prepare a Schedule for a Highrised building from starting stage to Handover?

1500

How to change a string in list ?

473

What are drilldown reports?

86

What is a custom controller?

103

List some opensource libraries for nlp?

471

What is difference between pop and oop?

609

Explain odi architecture?

296

What's the difference between super() and super(props) in React when using ES6 classes?

196

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 }

2715