The first problem I mentioned is a similar problem. but the second one seems to be little difficult. where additional path we could go is up.
- Azhar. On Thu, Dec 15, 2011 at 10:17 PM, Dheeraj Jain <[email protected]>wrote: > http://www.geeksforgeeks.org/archives/14943 is a very similar problem. > > > On Thu, Dec 15, 2011 at 1:12 PM, WgpShashank > <[email protected]>wrote: > >> @Azhar , also for 1st question u r trying Array DS will suffices. Its >> Standard Coin Change Problem , u need to solve subproblem 1st , store it in >> extra array to avoid recalculation , if u are able to produce the sum less >> given sum then u can use same approach to reach desired sum . it uses the >> memozation (DP) approach solve efficiently . >> >> >> hope it help. >> >> >> Thanks >> Shashank Mani >> CSE, BIT Mesra >> http://shashank7s.blogspot.com/ >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To view this discussion on the web visit >> https://groups.google.com/d/msg/algogeeks/-/N3nEi3dNwR0J. >> >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
