Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...

Company Name Starts with ...
#  A  B  C  D  E   F  G  H  I  J   K  L  M  N  O   P  Q  R  S  T   U  V  W  X  Y  Z

Solutions Company Interview Questions
Questions Answers Views Company eMail

Role of quality analyst in bpo

20 277643

Post New Solutions Company Interview Questions




Un-Answered Questions

what is the difference between black box testing and white box testing?

1218


What are the 5 main product offered by tableau company?

415


What do you understand by weak reference?

1065


What is difference between array_merge and array_combine?

1132


what approach do you folllow in writing test cases?

2147


What is marketing mix?

1195


What do you mean by disjoint set adt?

1035


How do you send email on SQL Server?

1114


What is the specific speed of a pump ?

1075


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


Why head of a centrifugal pump is independent of density of fluid?.

2518


Why is node asynchronous?

540


In BDC, data transfer is done success in foreground mode but if we done the same in background mode it shows errors. What is the reason?

1519


What is pathmatch in angular routing?

908


Explain the advantage of structures?

1008