@Azhar , 1st Try to formulate the recursive relation , then draw recursive 
tree , then u willl know why it need DP to solve efficiently , then u can 
memozation to solve the same .


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/-/DsXBmT8icfUJ.
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.

Reply via email to