~/problems
Problems
Basics first, then the classics, then company-style assessments. Every problem has tests you run right here; multi-level ones unlock as you go. See the roadmap.
Interview roadmap
1-D dynamic programming
One index of state: stairs, robbers, subsequences.
23 problems
Interview roadmap
1-D dynamic programming One index of state: stairs, robbers, subsequences.
Intro DP guide
- Basics: Cheapest way up a staircase basics py · c++ · java easy
- Flower cart: station or park py · c++ · java easy
- Climbing Stairs py · c++ · java easy
- House Robber py · c++ · java easy
- Decode Ways medium
- Maximum Subarray py · c++ · java easy
- Ordered dice rolls that hit a target sum py · c++ · java easy
- Count schedules with no process in two slots in a row Citadel py · c++ · java easy
- Collatz Sequence Steps AirbnbBloomberg medium
- Knight hops on a phone keypad Citadel py · c++ · java medium
- Best score with prime-3 jumps Uber py · c++ · java medium
- Word Break py · c++ · java medium
- Cheapest climb with strides of one to three steps py · c++ · java easy
- House Robber II py · c++ · java medium
- Maximum Product Subarray py · c++ · java medium
- Best Time to Buy and Sell Stock with Cooldown py · c++ · java medium
- Maximum Sum Circular Subarray py · c++ · java medium
Longest increasing subsequence guide
- Basics: LIS length ending at each index (O(n²) DP) basics py · c++ · java easy
- Choir line with a height gap py · c++ · java medium
- Longest Increasing Subsequence py · c++ · java medium
- Russian Doll Envelopes py · c++ · java hard
- Towers py · c++ · java medium
- Reconstruct a longest increasing subsequence py · c++ · java medium