I want to share collection of top 50 *classical* data structures problems from this discussion on reddit.

- 2-Sum Problem
- Longest Common Subsequence Problem
- Maximum Subarray Problem
- Coin Change Problem
- 0–1 Knapsack Problem
- Subset Sum Problem
- Longest Palindromic Subsequence Problem
- Matrix Chain Multiplication Problem
- Longest Common Substring Problem
- Rod Cutting Problem
- Word Break Problem
- Edit Distance Problem
- Chess Knight Problem
- Partition Problem
- 3-Partition Problem
- Snake and Ladder Problem
- Consecutive Largest Subarray Problem
- Largest Consecutive Subarray Problem
- Dutch National Flag Problem
- Knight’s Tour Problem
- Maximum Sum Submatrix Problem
- Longest Palindromic Substring Problem
- Job Sequencing Problem
- N Queens Problem
- Maximum Product Subarray Problem
- Longest Repeated Subsequence Problem
- 3-Sum Problem
- Shortest Common Supersequence Problem
- Longest Alternating Subarray Problem
- 4-Sum Problem
- K-Partition Problem
- Minimum Sum Partition Problem
- Wildcard Pattern Matching Problem
- Minimum Platforms Problem
- Graph Coloring Problem
- Longest Increasing Subsequence Problem
- Pots of Gold Game Problem
- Activity Selection Problem
- Longest Alternating Subsequence Problem
- Longest Consecutive Subsequence Problem
- Trapping Rain Water Problem
- Weighted Interval Scheduling Problem
- Longest Bitonic Subarray Problem
- Merging Overlapping Intervals
- Longest Common Prefix (LCP) Problem
- Maximum Product Rod Cutting Problem
- Box Stacking Problem
- Maximum Product Subset Problem
- Travelling Salesman Problem
- Clock Angle Problem

**Thanks.**