Answer Posted /

Hi I am Ashutosh Gupta stenographer 2013 in the office of the PDA/NCR Allahabad,(CAG) I want to Mutual transfer CAG office Delhi, any body who come to Allahabad please contact me, my no 9411910434 Thanks

1621

---

How the OLE Control interfaces relate to the OLE Container interfaces?

2872

---

How can i do partition of my hard disk in preloaded windows 7 in my system

907

---

How can I get a list of connection agreements in exchange 2003 adc?

963

---

What is map () in python?

842

---

Why lose 1 phase voltage in 33kv to 415v stepdown transformer

1744

---

what is service tax? how its count? and why its count?

2001

---

Maine 12th ke bad 2 years ka web designing ka course kiya hai. Php me achcha hu. Ek fresher ko is field me kitna mil sakta hai ?

5181

---

What are steps to create an attribute view?

87

---

What does "1"+2+3 evaluate to?

948

---

What is upsert and how external id are beneficial? : salesforce Data Management

517

---

A polynomials in mamory can be represented by____________

2108

---

What are the options we can rollback if we enable them while creating custom entity?

762

---

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 }

3191

---

What is -> symbol in perl?

1011

---