Getting Started with Competitive Programming
Six problems that take you from reading input to your first dynamic programming solution. Solve them in order — each one introduces exactly one new idea.
| # | Problem | Difficulty | Why this one | |
|---|---|---|---|---|
| 1 | Sum of Two Numbers | 800 | Warm up: reading input, printing output | Open |
| 2 | Even or Odd | 800 | Conditionals and 64-bit integers | Open |
| 3 | Reverse a String | 900 | String handling basics | Open |
| 4 | Count the Vowels | 1000 | Loops and counting | Open |
| 5 | Maximum of an Array | 900 | Arrays and a single pass | Open |
| 6 | Fibonacci Number | 1100 | Your first DP recurrence | Open |