Amazon Interview Report
- 0of 0 votes
Answersgiven a set of integers [6,8,41,36,58,69]
- getjar.com/todotasklist my android app September 13, 2011 in -
is there any way with time complexity better than 2^n to find 1 subset whose sum is equal to a given sum.
for eg:sum 49 ans 8,41
sum 105 ans 6 ,41 58| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer - 0of 0 votes
Answersgiven two arrays [5 6 2 8 1] or [4 7 9 2 4]...such arrays are given, you have to find
- getjar.com/todotasklist my android app September 13, 2011 in -
possible pairs where sum of numbers in both arrays of a pair is equal....eg
for the first case it will be [5 6] and [2 8 1]
write a program to implement this| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Algorithm
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.