how to customize the view of my mailboxes?

5

How would you measure correlation in r?

60

Differentiate between Join, Merge and Lookup stage?

645

What is the architecture of sap crm?

599

What are empty tags?

442

Define APIs and use in Oracle HRMS?

566

What we can use to migrate use profile information from one computer to another?

465

What are pass by value and pass by reference?what is the disadvantage of pass by value?

511

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 }

2710

What is an order of a system.

722

Can I download microsoft word?

318

why the flower petals are in particular is any biochemical work for that?

1465

What is subrogation? : insurance sales

328

Why in KE5Z report in SAP Accounting Data not found?

3557

Why is runtime broker using so much cpu?

460