Top 50 Classic Data Structures Problems

1. 2–Sum ProblemEasy
2. Longest Common Subsequence ProblemMedium
3. Maximum Subarray ProblemEasy
4. Coin Change ProblemHard
5. 0–1 Knapsack ProblemMedium
6. Subset Sum ProblemMedium
7. Longest Palindromic Subsequence ProblemMedium
8. Matrix Chain Multiplication ProblemHard
9. Longest Common Substring ProblemMedium
10. Rod Cutting ProblemMedium
11. Word Break ProblemHard
12. Edit Distance ProblemMedium
13. Chess Knight ProblemHard
14. Partition ProblemMedium
15. 3–Partition ProblemMedium
16. Snake and Ladder ProblemHard
17. Largest Consecutive Subarray ProblemMedium
18. Dutch National Flag ProblemMedium
19. Knight’s Tour ProblemHard
20. Maximum Sum Submatrix ProblemMedium
21. Longest Palindromic Substring ProblemMedium
22. Job Sequencing ProblemMedium
23. N–Queens ProblemHard
24. Maximum Product Subarray ProblemHard
25. Longest Repeated Subsequence ProblemMedium
26. 3–Sum ProblemMedium
27. Shortest Common Supersequence ProblemMedium
28. Longest Alternating Subarray ProblemEasy
29. 4–Sum ProblemMedium
30. K–Partition ProblemHard
31. Minimum Sum Partition ProblemHard
32. Wildcard Pattern Matching ProblemHard
33. Maximum Overlapping Intervals ProblemMedium
34. Graph Coloring ProblemMedium
35. Longest Increasing Subsequence ProblemHard
36. Pots of Gold Game ProblemHard
37. Activity Selection ProblemEasy
38. Longest Alternating Subsequence ProblemMedium
39. Longest Consecutive Subsequence ProblemMedium
40. Trapping Rain Water ProblemHard
41. Weighted Interval Scheduling ProblemMedium
42. Longest Bitonic Subarray ProblemMedium
43. Water Jugs ProblemHard
44. Hat Check ProblemMedium
45. Merging Overlapping IntervalsMedium
46. Longest Common Prefix (LCP) ProblemMedium
47. Maximum Product Rod Cutting ProblemMedium
48. Box Stacking ProblemHard
49. Maximum Product Subset ProblemEasy
50. Maximum Independent Set ProblemMedium

 
Also See:

Top 25 Algorithms Every Programmer Should Know