How can we do data cleaning?

1055

What is the alpha check execution program?

2229

Differentiate between Canvas and SVG?

890

What is data independence and also explain its types?

904

When you see a site for the first time to seo, what are your first steps?

758

Do all html tags have an end tag?

804

What is 'banknet'?

1161

Which database is used by google?

984

Explain me soundex() and metaphone()?

991

What do you understand by nosql databases?

1

What kind of email is outlook?

5

Why should I use mysql?

933

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 }

3189

What are Guarantees provided by Kafka?

520

Difference between list Obj-list-view results and obj-browse?

609