How can inflation be controlled?

1298

---

Define resonant frequency?

1259

---

how may join possible between (requisition with purchase order)

2331

---

What is the epoch date?

1071

---

Tell us about our company and can you work independently?

1170

---

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 }

3244

---

How do I label columns in excel 2016?

622

---

What is the difference between null value, zero, and blank space?

1257

---

What is the difference between normal view and outline view?

942

---

How do I change a text file to xml?

1014

---

What is horizon or horizontal mining?

1166

---

Describe the life-cycle of a software development (application design) process.

876

---

Can laravel be hacked?

753

---

Fire Engine should be stopped in auto mode or not. If stopped then why and if not then why not?

2631

---

List out the other components of cassandra?

99

---