Set 18
Advanced Dynamic Programming
Seven problems, ramping from Very Easy to Extreme.
Progress · 0/7 solved
- VERY EASYQ1Coin Change — Minimum Coins
- EASYQ2Longest Common Subsequence
- MEDIUMQ3Matrix Chain Multiplication (min scalar multiplications)
- MEDIUM-HARDQ4Longest Palindromic Subsequence
- HARDQ5Maximum GCD-LIS Combined (final boss, matches Problem J exactly)
- VERY HARDQ6Longest Increasing Subsequence With At Most One Deletion
- EXTREMEQ7Maximum GCD-Sum Subsequence (weighted variant)