Introduces dynamic programming with a simple recurrence relation to build intuition.

A classic graph traversal problem using DFS or BFS to find connected components.

A foundational problem for learning how to use hash maps for efficient lookups, a key technique in coding interviews.

Teaches sliding window techniques to solve substring problems efficiently.

An important question for understanding interval manipulation, useful in scheduling problems.

Combines binary search and rotation logic, helping to improve problem-solving with search techniques.

Demonstrates how to solve array problems efficiently using prefix and suffix arrays without division.

A graph-based problem that introduces concepts like topological sorting and cycle detection.

Uses dynamic programming to determine if a string can be segmented into dictionary words, building understanding of overlapping subproblems.

An advanced problem that explores two-pointer techniques and the concept of maintaining state for water levels.