Aryan
BAN USER
Questions (1)
Comments (15)
Reputation 30
- 0of 0 votes
AnswersAn array arr[] has coins of several denominations. Given the array and a required Sum find the minimum number of picks to get that sum. eg:
- Aryan in India
Input: {1,3,10} Sum required = 11
Output: 1+10 => 2 pickings| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
@Satish: Generalizing from above, if the first jumper knows if he's gonna get heaven of hell, he can convey this in the piece of paper and not open the parachute. Now based on what is written in the paper, the second jumper can either kill the diving instructor to reach hell or he can bequeath all his property to charity in order to reach heaven! -----> Learning: Give super troll solutions or don't try to go that side.
- Aryan March 26, 2012Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
@Sachin: I guess the person who asked this question meant the same i.e. non-repeated character or a character unique to the whole string.
- Aryan July 18, 2012@Barney: I think I agree with anonymous on this one. It doesn't seem possible to do in o(logn).