Answer Posted / pritam

I think Abhradeep Chatterjee is a real STUPID.

What is c preprocessor mean?

1295

---

What are the 32 keywords in c?

1078

---

What are unions in c?

1019

---

Define and explain about ! Operator?

986

---

Is it cc or c in a letter?

1009

---

a linearly ordered set of data elements that have the same structure and whose order is preserved in storage by using sequential allocation a) circular b) ordinary c) array d) linear list

1053

---

What are the parts of c program?

1093

---

What do you mean by dynamic memory allocation in c?

1088

---

What does s c mean in text?

1089

---

What is the difference between exit() and _exit() function?

1029

---

Write a program to swap two numbers without using third variable?

1280

---

What is a program flowchart and how does it help in writing a program?

1129

---

1234554321 1234 4321 123 321 12 21 1 1 12 21 123 321 1234 4321 1234554321

3698

---

What is pointers in c?

1098

---

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 }

3176

---