What is channel coding in gsm technology?

1000

---

how to do daily transactions with out sql* loader control file regesterd in apps?

1729

---

What is the best tool to develop Play/Scala applications to persist data in MongoDB NoSQL data store?

7

---

Does caching have a negative effect on your load testing results?

1202

---

How do I get rid of negative zeros in excel?

709

---

How do I create a bootstrap subtheme in drupal 8?

115

---

What does egrep mean?

1025

---

How silverlight 4 is different from silverlight 3?

1

---

What is S/WAN ?

1946

---

Does resetting windows 10 remove product key?

905

---

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 }

3241

---

What is difference css and css3?

783

---

What are logical and physical text styles?

1084

---

What is double buffering ?

1069

---

Is mvc different from a three layered architecture?

1

---