Avenger
BAN USER
Questions (2)
Comments (6)
Reputation 150
- 0of 0 votes
AnswersGiven 'n' coins, print the number of ways to form an amount 'A' . This is a standard denomination problem with one small twist(We have only one coin of each type,not infinite number,if we choose one coin for making change we should not choose it again) . Can somebody give a code with explanation ?
- Avenger in India for Bing
Example:
Amount:3 coins : 1 2 3
There are only two ways (1,2)(3) not (1,1,1)(1,2)(3)| Report Duplicate | Flag | PURGE
Microsoft 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.
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
Please read the question. It is given that the circular linked list's last node points to middle node,you can't traverse till curr!=NULL,you'll end up in indefinite loop :)
- Avenger August 08, 2013