Zone of protection and tripping scheme of arc protection relay.

1407

---

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 }

2712

---

How to deactivate IPC in standalone CRM.

2572

---

Why functions are used in sql?

513

---

How do I enable postgis on pgadmin?

428

---

---

How has technology effected the way that we receive news

2056

---

what are .ctl(control files) files ? how the dataset stage have better performance by this files?

2179

---

Explain the functions of paring disc and flow control disc in purifier and clarifier?

756

---

Have you ever managed writing the test cases without having any documents?

611

---

Illustrate a few of your qualities which fall in line with HCL's vision statement.

4458

---

How to check the meatadata of a table?

191

---

What is self contained sub query?

559

---

What does the “USE” command in the hive do?

407

---

Why are pointers not secure?

537

---

What is centre priming?

978

---