Amazon Interview Report
- 0of 0 votes
AnswersWe have two sorted int arrays
- Kavitha fucker July 27, 2011
a[] --> size N --> contains N elements
b[] --> size 2N --> contains N elements, and N vacant locations
Write an algorithm of complexity O(n) such that b[] contains elements of a[] and b[] in ascending order.| Report Duplicate | Flag | PURGE
Amazon Software Engineer in Test Algorithm - 0of 0 votes
AnswersWe have two int arrays, find duplicate among them.
- Kavitha fucker July 27, 2011| Report Duplicate | Flag | PURGE
Amazon Software Engineer in Test Algorithm - 0of 0 votes
AnswersFind all the pairs of integers whose sum is S in an int array.
- Kavitha fucker July 27, 2011| Report Duplicate | Flag | PURGE
Amazon Software Engineer in Test Algorithm
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.