Is This Answer Correct ? Yes No

Why use -48v power to BTS

678

How To increase Knowledge Of boliler regarding To Only Electrical Field..

119

What is the difference between Tinanium Debit card and Platinuim Debit card?

917

# What is D-FF? # What is the basic difference between Latches and Flip flops? # What is a multiplexer? # How can you convert an SR Flip-flop to a JK Flip-flop? # How can you convert an JK Flip-flop to a D Flip-flop? # What is Race-around problem? How can you rectify it?

805

What is the best hardware configuration to run Hadoop?

144

Provision for Service tax, Income tax and Sales tax

745

What is the difference between WebIntelligence and Designer in creating universes?

623

i am one of applicant for applying to jobs of physics lecturers. caould u have an opportunity for us according to our education and experience

1171

What is Your approach while testing mobile applications? Is it diffrent for ios and android?

2097

448

what is management?

626

What is the abbreviation of NGT panel

534

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 }

1759

hi, i m from india, my hunband is in uk, he is there from last 6 years, i want to know how many bands of general ielts i need to for the uk spouse visa.

1163

plz explain abt refrigeration r22 bitzer comprassors trouble shooting and maintenance

532