Dynamic Programming
Dynamic programming problems in Golang, grouped by difficulty — with the core pattern called out for each.
Easy 1
- Min Cost Climbing StairsDynamic programming
Medium 8
- Coin ChangeDynamic programming
- Count Strictly Increasing SubarraysDynamic programming
- House RobberDynamic programming
- Longest Common SubsequenceDynamic programming
- Longest Increasing SubsequenceDynamic programming
- Longest Palindromic SubstringDynamic programming
- Minimum Path SumDynamic programming
- Unique PathsDynamic programming
Hard 1
- Maximum Profit in Job SchedulingDP + binary search