How to Calculate the Fault Level of Electrical Installation

2307

What are the difference between python and java?

1114

About peer reviews ?

2632

What is thread in swift?

845

Can we override the static method?

1079

What is the difference between library vs list?

819

What things are performed by dynamic objects?

751

Can the exchange 2007 server roles be deployed and configured on the same physical hardware?

908

If you take home loan for 10 lacs and what is the margin?

1117

What is the confusion matrix in machine learning?

139

How many types of processes are there in sap netweaver application server? Explain

984

Which is best os for android mobile?

966

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 }

3230

How to remove the first line/header from a file in Unix?

1099

after medical test,when will be the police verification

2220