What are the advantages and disadvantages of thread-safe jsp page?

981

---

How to set the permissions to a file in java?

979

---

Explain about non-XML resources?

931

---

How does regulation compliance enhance trust in AI systems?

1

---

What things you should not do on while flying?

1173

---

why is the in steam turbine axial displacement of active side thrust pad is positive and non active side thrust pad is negative.

3248

---

What are the basic assumptions in accounting?

1106

---

Define compaction in HBase?

166

---

What are the Exception Methods in salesforce?

441

---

What is Co- and Contra-Variance in C#?

980

---

How do I use solver in excel for mac?

697

---

What is api php in laravel?

782

---

What challenges arise when implementing AI governance frameworks?

1

---

What are the advantages of cascading style sheets?

651

---

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 }

3181

---