Dynamic Programming
16 practice items · needed by 14 roles
Easy 2Medium 6Hard 8
Coding problems
- Set-Bit Count Tableeasy
- Staircase With Allowed Strideseasy
- Cheapest Route With Limited Layoversmedium
- Fewest Coins for an Amountmedium
- Fill the Cargo Holdmedium
- Longest Shared Subsequencemedium
- Longest Strictly Rising Subsequencemedium
- Robot Paths Around Blocked Tilesmedium
- Best Path Sum in a Treehard
- Best Profit With at Most K Tradeshard
- Count Hidden Copies of a Patternhard
- Edit Distance Between Stringshard
- Fewest Monitors to Watch a Treehard
- Glob Pattern Matchinghard
- Pop Lanterns for the Most Coinshard
- Shortest Delivery Loophard