How do I find my rss feed on android?

895

How do I get to root in ubuntu?

814

What is the purpose of pivot stage and types of containers in datastage

1082

What advantages does Spark offer over Hadoop MapReduce?

313

Explain the scala anonymous function.

1

What does it cost to replace struts?

1025

Does htop show threads?

862

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 }

3237

How to create a link between multiple maps in a mapset? How to make use of Transid in this case?

1890

Tell some examples of bug severity and bug priority?

1145

Why we are using windows xp as a clients for windows servers

2979

What is the implicit cursor in oracle?

1169

What is the default microsoft word font?

675

How to edit standard SAPSCRIPT called by standard program ?

6694

Presently i am working on QTP 8.2 Version,i want to know features in 9.2 version, because i have not sufficient time to put the effort on the 9.2 version

1888