Explain nodetool utility.

99

---

What is Morphological smoothing?

1728

---

What is a plugin in wordpress?

169

---

How to run a test case from a test script file?

1108

---

Explain the properties of union.

1092

---

What are the reasons that winrunner fails to identify gui object?

1035

---

Explain validation concept in laravel.

722

---

How do we sort the data from a dataset?

978

---

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 Hive Database?

708

---

What will happen if the d.c. Shunt motor opened accidentally running on no-load has its shunt field winding?

1481

---

how to map requirements& test cases in quality center ???

2629

---

What is Spark Executor?

5

---

How do I change the default font in excel 2016?

698

---

how LINQ with databases can be used?

107

---