What is format menu?

574

---

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 }

3132

---

What is a 'PLPD' insurance stand for?

1174

---

What are the reasons for process termination?

973

---

How many moles of hcl are present in .70 l of a .33 m hcl solution?

955

---

How can you create a bookmark in QlikView?

5

---

What is cache in codeigniter?

572

---

Within the interview process you may be required to perform a role-play. A popular example of this is being asked to role-play an escalated call with an unhappy customer.

2147

---

Explain Wireless networks.

1491

---

How to submit a jcl from cics?

1094

---

What does it mean for a search engine to index a site?

146

---

What does joomla do?

76

---

Explain Openpages Capital Modeling?

1080

---

What does the **kwargs do in python?

858

---

What is the importance of Natural language processing?

855

---