What is the density of stars?

126

---

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 }

3194

---

What is the difference between the load balancer route-53 and the normal route-53?

137

---

How do I reduce font size in visual studio?

659

---

Explain non breaking space in html.

955

---

How is unix different from linux?

1061

---

Is as operator in c#?

888

---

Which indian missile was successfully launched on 11th april 1999?

827

---

For raising client billing, is there any possibility of linking line items in sd module with activities / wbs in ps module?

1049

---

what is the command to know key fields of file?

1178

---

What is script? Its advantages?

1168

---

Which is easier to learn react or angular?

859

---

Can we write ddl statements in functions?

1118

---

What is a callback hell?

521

---

How do you send enter/tab keys in webdriver?

942

---