I just started with the dynamic programming and tried to solve codechef problems based on dp tag from highest no. of submissions but they are too hard. can anyone give me link to some good dp problems so that I can master dp. and how to approach dp problems??
First try some well known dp problems then move on to questions and try to convert/compare them into/with these problems.
- Some well known dp problems with tutorial- Dynamic Programming Practice Problems
- Look under dynamic programming- Top 10 Algorithms and Data Structures for Competitive Programming - GeeksforGeeks
- A video lecture I found interesting for starters- Algorithms - Lecture 9: Dynamic Programming - YouTube
- Top Coder tutorial blog- Topcoder
- questions:-
(i).Programming Problems and Competitions :: HackerRank
(ii).http://codeforces.com/problemset/tags/dp/page/1?order=BY_SOLVED_DESC#
(iii).Some dp problems I solved recently on cc and found easy for newbies:
A1 Problem - CodeChef
FROGV Problem - CodeChef
KSPHERES Problem - CodeChef
Try HACKERRANK problems FIRST as they are based on well known dp problems.
Hope this helps.
Happy Coding
3 Likes
Try this: http://acm.hust.edu.cn/vjudge/contest/view.action?cid=109369
You can find here very easy DP problems.
1 Like
Lol this guy @sahil_g posts almost the same links mentioned above and gets 2 upvotes from the top 2 contributors of the month from the same college . Dosen’t it smell a bit fishy
Most of the links have been posted above ,
but here is a interesting quora thread ,
hope you find it useful.