Dynamic Programming Interview Questions

Optimal substructure, overlapping subproblems, and state design.

459 problems

#	Title	Difficulty	Topics
10	Regular Expression Matching	Hard	dynamic programming
44	Wildcard Matching	Hard	dynamic programming
53	Maximum Subarray	Easy	dynamic programming
62	Unique Paths	Medium	dynamic programming
63	Unique Paths II	Medium	dynamic programming
64	Minimum Path Sum	Medium	dynamic programming
70	Climbing Stairs	Easy	dynamic programming
72	Edit Distance	Hard	dynamic programming
87	Scramble String	Hard	dynamic programming
91	Decode Ways	Medium	dynamic programming
96	Unique Binary Search Trees	Medium	dynamic programming
97	Interleaving String	Hard	dynamic programming
115	Distinct Subsequences	Hard	dynamic programming
120	Triangle	Medium	dynamic programming
123	Best Time to Buy and Sell Stock III	Hard	dynamic programming
132	Palindrome Partitioning II	Hard	dynamic programming
139	Word Break	Medium	dynamic programming
152	Maximum Product Subarray	Medium	dynamic programming
174	Dungeon Game	Hard	dynamic programming
188	Best Time to Buy and Sell Stock IV	Hard	dynamic programming
198	House Robber	Easy	dynamic programming
213	House Robber II	Medium	dynamic programming
221	Maximal Square	Medium	dynamic programming
256	Paint House	Medium	dynamic programming
265	Paint House II	Hard	dynamic programming
276	Paint Fence	Easy	dynamic programming
279	Perfect Squares	Medium	dynamic programming
303	Range Sum Query - Immutable	Easy	dynamic programming
304	Range Sum Query 2D - Immutable	Medium	dynamic programming
309	Best Time to Buy and Sell Stock with Cooldown	Medium	dynamic programming
312	Burst Balloons	Hard	dynamic programming
322	Coin Change	Medium	dynamic programming
351	Android Unlock Patterns	Medium	dynamic programming
357	Count Numbers with Unique Digits	Medium	dynamic programming
361	Bomb Enemy	Medium	dynamic programming
368	Largest Divisible Subset	Medium	dynamic programming
375	Guess Number Higher or Lower II	Medium	dynamic programming
377	Combination Sum IV	Medium	dynamic programming
403	Frog Jump	Hard	dynamic programming
416	Partition Equal Subset Sum	Medium	dynamic programming
418	Sentence Screen Fitting	Medium	dynamic programming
446	Arithmetic Slices II - Subsequence	Hard	dynamic programming
465	Optimal Account Balancing	Hard	dynamic programming
466	Count The Repetitions	Hard	dynamic programming
467	Unique Substrings in Wraparound String	Medium	dynamic programming
471	Encode String with Shortest Length	Medium	dynamic programming
472	Concatenated Words	Medium	dynamic programming
474	Ones and Zeroes	Medium	dynamic programming
486	Predict the Winner	Medium	dynamic programming
494	Target Sum	Medium	dynamic programming
509	Fibonacci Number	Easy	dynamic programming
514	Freedom Trail	Hard	dynamic programming
516	Longest Palindromic Subsequence	Medium	dynamic programming
518	Coin Change 2	Medium	dynamic programming
546	Remove Boxes	Hard	dynamic programming
552	Student Attendance Record II	Hard	dynamic programming
562	Longest Line of Consecutive One in Matrix	Medium	dynamic programming
568	Maximum Vacation Days	Hard	dynamic programming
576	Out of Boundary Paths	Medium	dynamic programming
583	Delete Operation for Two Strings	Medium	dynamic programming
600	Non-negative Integers without Consecutive Ones	Hard	dynamic programming
629	K Inverse Pairs Array	Hard	dynamic programming
639	Decode Ways II	Hard	dynamic programming
650	2 Keys Keyboard	Medium	dynamic programming
656	Coin Path	Hard	dynamic programming
664	Strange Printer	Hard	dynamic programming
673	Number of Longest Increasing Subsequence	Medium	dynamic programming
688	Knight Probability in Chessboard	Medium	dynamic programming
689	Maximum Sum of 3 Non-Overlapping Subarrays	Hard	dynamic programming
691	Stickers to Spell Word	Hard	dynamic programming
712	Minimum ASCII Delete Sum for Two Strings	Medium	dynamic programming
714	Best Time to Buy and Sell Stock with Transaction Fee	Medium	dynamic programming
727	Minimum Window Subsequence	Hard	dynamic programming
730	Count Different Palindromic Subsequences	Hard	dynamic programming
740	Delete and Earn	Medium	dynamic programming
741	Cherry Pickup	Hard	dynamic programming
746	Min Cost Climbing Stairs	Easy	dynamic programming
750	Number Of Corner Rectangles	Medium	dynamic programming
764	Largest Plus Sign	Medium	dynamic programming
788	Rotated Digits	Easy	dynamic programming
790	Domino and Tromino Tiling	Medium	dynamic programming
799	Champagne Tower	Medium	dynamic programming
801	Minimum Swaps To Make Sequences Increasing	Medium	dynamic programming
805	Split Array With Same Average	Hard	dynamic programming
808	Soup Servings	Medium	dynamic programming
813	Largest Sum of Averages	Medium	dynamic programming
818	Race Car	Hard	dynamic programming
823	Binary Trees With Factors	Medium	dynamic programming
837	New 21 Game	Medium	dynamic programming
838	Push Dominoes	Medium	dynamic programming
847	Shortest Path Visiting All Nodes	Hard	dynamic programming
877	Stone Game	Medium	dynamic programming
879	Profitable Schemes	Hard	dynamic programming
903	Valid Permutations for DI Sequence	Hard	dynamic programming
920	Number of Music Playlists	Hard	dynamic programming
926	Flip String to Monotone Increasing	Medium	dynamic programming
931	Minimum Falling Path Sum	Medium	dynamic programming
935	Knight Dialer	Medium	dynamic programming
940	Distinct Subsequences II	Hard	dynamic programming
943	Find the Shortest Superstring	Hard	dynamic programming
956	Tallest Billboard	Hard	dynamic programming
960	Delete Columns to Make Sorted III	Hard	dynamic programming
964	Least Operators to Express Number	Hard	dynamic programming
975	Odd Even Jump	Hard	dynamic programming
980	Unique Paths III	Hard	dynamic programming
983	Minimum Cost For Tickets	Medium	dynamic programming
1000	Minimum Cost to Merge Stones	Hard	dynamic programming
1027	Longest Arithmetic Sequence	Medium	dynamic programming
1035	Uncrossed Lines	Medium	dynamic programming
1039	Minimum Score Triangulation of Polygon	Medium	dynamic programming
1043	Partition Array for Maximum Sum	Medium	dynamic programming
1048	Longest String Chain	Medium	dynamic programming
1049	Last Stone Weight II	Medium	dynamic programming
1066	Campus Bikes II	Medium	dynamic programming
1092	Shortest Common Supersequence	Hard	dynamic programming
1105	Filling Bookcase Shelves	Medium	dynamic programming
1125	Smallest Sufficient Team	Hard	dynamic programming
1137	N-th Tribonacci Number	Easy	dynamic programming
1139	Largest 1-Bordered Square	Medium	dynamic programming
1140	Stone Game II	Medium	dynamic programming
1143	Longest Common Subsequence	Medium	dynamic programming
1155	Number of Dice Rolls With Target Sum	Medium	dynamic programming
1182	Shortest Distance to Target Color	Medium	dynamic programming
1186	Maximum Subarray Sum with One Deletion	Medium	dynamic programming
1187	Make Array Strictly Increasing	Hard	dynamic programming
1191	K-Concatenation Maximum Sum	Medium	dynamic programming
1216	Valid Palindrome III	Hard	dynamic programming
1218	Longest Arithmetic Subsequence of Given Difference	Medium	dynamic programming
1220	Count Vowels Permutation	Hard	dynamic programming
1223	Dice Roll Simulation	Medium	dynamic programming
1230	Toss Strange Coins	Medium	dynamic programming
1235	Maximum Profit in Job Scheduling	Hard	dynamic programming
1239	Maximum Length of a Concatenated String with Unique Characters	Medium	dynamic programming
1246	Palindrome Removal	Hard	dynamic programming
1262	Greatest Sum Divisible by Three	Medium	dynamic programming
1269	Number of Ways to Stay in the Same Place After Some Steps	Hard	dynamic programming
1277	Count Square Submatrices with All Ones	Medium	dynamic programming
1278	Palindrome Partitioning III	Hard	dynamic programming
1289	Minimum Falling Path Sum II	Hard	dynamic programming
1292	Maximum Side Length of a Square with Sum Less than or Equal to Threshold	Medium	dynamic programming
1301	Number of Paths with Max Score	Hard	dynamic programming
1312	Minimum Insertion Steps to Make a String Palindrome	Hard	dynamic programming
1314	Matrix Block Sum	Medium	dynamic programming
1320	Minimum Distance to Type a Word Using Two Fingers	Hard	dynamic programming
1335	Minimum Difficulty of a Job Schedule	Hard	dynamic programming
1340	Jump Game V	Hard	dynamic programming
1387	Sort Integers by The Power Value	Medium	dynamic programming
1388	Pizza With 3n Slices	Hard	dynamic programming
1395	Count Number of Teams	Medium	dynamic programming
1397	Find All Good Strings	Hard	dynamic programming
1406	Stone Game III	Hard	dynamic programming
1411	Number of Ways to Paint N × 3 Grid	Hard	dynamic programming
1416	Restore The Array	Hard	dynamic programming
1420	Build Array Where You Can Find The Maximum Exactly K Comparisons	Hard	dynamic programming
1434	Number of Ways to Wear Different Hats to Each Other	Hard	dynamic programming
1444	Number of Ways of Cutting a Pizza	Hard	dynamic programming
1449	Form Largest Integer With Digits That Add up to Target	Hard	dynamic programming
1458	Max Dot Product of Two Subsequences	Hard	dynamic programming
1463	Cherry Pickup II	Hard	dynamic programming
1467	Probability of a Two Boxes Having The Same Number of Distinct Balls	Hard	dynamic programming
1473	Paint House III	Hard	dynamic programming
1477	Find Two Non-overlapping Sub-arrays Each With Target Sum	Medium	dynamic programming
1478	Allocate Mailboxes	Hard	dynamic programming
1494	Parallel Courses II	Hard	dynamic programming
1504	Count Submatrices With All Ones	Medium	dynamic programming
1510	Stone Game IV	Hard	dynamic programming
1524	Number of Sub-arrays With Odd Sum	Medium	dynamic programming
1531	String Compression II	Hard	dynamic programming
1547	Minimum Cost to Cut a Stick	Hard	dynamic programming
1548	The Most Similar Path in a Graph	Hard	dynamic programming
1553	Minimum Number of Days to Eat N Oranges	Hard	dynamic programming
1563	Stone Game V	Hard	dynamic programming
1575	Count All Possible Routes	Hard	dynamic programming
1594	Maximum Non Negative Product in a Matrix	Medium	dynamic programming
1595	Minimum Cost to Connect Two Groups of Points	Hard	dynamic programming
1617	Count Subtrees With Max Distance Between Cities	Hard	dynamic programming
1626	Best Team With No Conflicts	Medium	dynamic programming
1639	Number of Ways to Form a Target String Given a Dictionary	Hard	dynamic programming
1655	Distribute Repeating Integers	Hard	dynamic programming
1664	Ways to Make a Fair Array	Medium	dynamic programming
1681	Minimum Incompatibility	Hard	dynamic programming
1682	Longest Palindromic Subsequence II	Medium	dynamic programming
1690	Stone Game VII	Medium	dynamic programming
1691	Maximum Height by Stacking Cuboids	Hard	dynamic programming
1692	Count Ways to Distribute Candies	Hard	dynamic programming
1745	Palindrome Partitioning IV	Hard	dynamic programming
1746	Maximum Subarray Sum After One Operation	Medium	dynamic programming
1751	Maximum Number of Events That Can Be Attended II	Hard	dynamic programming
1770	Maximum Score from Performing Multiplication Operations	Medium	dynamic programming
1771	Maximize Palindrome Length From Subsequences	Hard	dynamic programming
1774	Closest Dessert Cost	Medium	dynamic programming
1787	Make the XOR of All Segments Equal to Zero	Hard	dynamic programming
1799	Maximize Score After N Operations	Hard	dynamic programming
1803	Count Pairs With XOR in a Range	Hard	dynamic programming
1857	Largest Color Value in a Directed Graph	Hard	dynamic programming
1866	Number of Ways to Rearrange Sticks With K Sticks Visible	Hard	dynamic programming
1871	Jump Game VII	Medium	dynamic programming
1872	Stone Game VIII	Hard	dynamic programming
1883	Minimum Skips to Arrive at Meeting On Time	Hard	dynamic programming
1896	Minimum Cost to Change the Final Value of Expression	Hard	dynamic programming
1900	The Earliest and Latest Rounds Where Players Compete	Hard	dynamic programming
1908	Game of Nim	Medium	dynamic programming
1931	Painting a Grid With Three Different Colors	Hard	dynamic programming
1937	Maximum Number of Points with Cost	Medium	dynamic programming
1955	Count Number of Special Subsequences	Hard	dynamic programming
1959	Minimum Total Space Wasted With K Resizing Operations	Medium	dynamic programming
1960	Maximum Product of the Length of Two Palindromic Substrings	Hard	dynamic programming
1977	Number of Ways to Separate Numbers	Hard	dynamic programming
1981	Minimize the Difference Between Target and Chosen Elements	Medium	dynamic programming
1986	Minimum Number of Work Sessions to Finish the Tasks	Medium	dynamic programming
1987	Number of Unique Good Subsequences	Hard	dynamic programming
1994	The Number of Good Subsets	Hard	dynamic programming
1997	First Day Where You Have Been in All the Rooms	Medium	dynamic programming
2002	Maximum Product of the Length of Two Palindromic Subsequences	Medium	dynamic programming
2008	Maximum Earnings From Taxi	Medium	dynamic programming
2019	The Score of Students Solving Math Expression	Hard	dynamic programming
2031	Count Subarrays With More Ones Than Zeros	Medium	dynamic programming
2044	Count Number of Maximum Bitwise-OR Subsets	Medium	dynamic programming
2052	Minimum Cost to Separate Sentence Into Rows	Medium	dynamic programming
2060	Check if an Original String Exists Given Two Encoded Strings	Hard	dynamic programming
2088	Count Fertile Pyramids in a Land	Hard	dynamic programming
2140	Solving Questions With Brainpower	Medium	dynamic programming
2143	Choose Numbers From Two Arrays in Range	Hard	dynamic programming
2167	Minimum Time to Remove All Cars Containing Illegal Goods	Hard	dynamic programming
2174	Remove All Ones With Row and Column Flips II	Medium	dynamic programming
2184	Number of Ways to Build Sturdy Brick Wall	Medium	dynamic programming
2188	Minimum Time to Finish the Race	Hard	dynamic programming
2189	Number of Ways to Build House of Cards	Medium	dynamic programming
2209	Minimum White Tiles After Covering With Carpets	Hard	dynamic programming
2218	Maximum Value of K Coins From Piles	Hard	dynamic programming
2222	Number of Ways to Select Buildings	Medium	dynamic programming
2247	Maximum Cost of Trip With K Highways	Hard	dynamic programming
2266	Count Number of Texts	Medium	dynamic programming
2267	Check if There Is a Valid Parentheses String Path	Hard	dynamic programming
2289	Steps to Make Array Non-decreasing	Hard	dynamic programming
2291	Maximum Profit From Trading Stocks	Medium	dynamic programming
2297	Jump Game VIII	Medium	dynamic programming
2304	Minimum Path Cost in a Grid	Medium	dynamic programming
2305	Fair Distribution of Cookies	Medium	dynamic programming
2312	Selling Pieces of Wood	Hard	dynamic programming
2313	Minimum Flips in Binary Tree to Get Result	Hard	dynamic programming
2318	Number of Distinct Roll Sequences	Hard	dynamic programming
2320	Count Number of Ways to Place Houses	Medium	dynamic programming
2327	Number of People Aware of a Secret	Medium	dynamic programming
2328	Number of Increasing Paths in a Grid	Hard	dynamic programming
2361	Minimum Costs Using the Train Line	Hard	dynamic programming
2369	Check if There is a Valid Partition For The Array	Medium	dynamic programming
2370	Longest Ideal Subsequence	Medium	dynamic programming
2378	Choose Edges to Maximize Score in a Tree	Medium	dynamic programming
2380	Time Needed to Rearrange a Binary String	Medium	dynamic programming
2403	Minimum Time to Kill All Monsters	Hard	dynamic programming
2420	Find All Good Indices	Medium	dynamic programming
2430	Maximum Deletions on a String	Hard	dynamic programming
2431	Maximize Total Tastiness of Purchased Fruits	Medium	dynamic programming
2435	Paths in Matrix Whose Sum Is Divisible by K	Hard	dynamic programming
2447	Number of Subarrays With GCD Equal to K	Medium	dynamic programming
2463	Minimum Total Distance Traveled	Hard	dynamic programming
2464	Minimum Subarrays in a Valid Split	Medium	dynamic programming
2466	Count Ways To Build Good Strings	Medium	dynamic programming
2470	Number of Subarrays With LCM Equal to K	Medium	dynamic programming
2475	Number of Unequal Triplets in Array	Easy	dynamic programming
2478	Number of Beautiful Partitions	Hard	dynamic programming
2495	Number of Subarrays Having Even Product	Medium	dynamic programming
2510	Check if There is a Path With Equal Number of 0's And 1's	Medium	dynamic programming
2518	Number of Great Partitions	Hard	dynamic programming
2533	Number of Good Binary Strings	Medium	dynamic programming
2538	Difference Between Maximum and Minimum Price Sum	Hard	dynamic programming
2547	Minimum Cost to Split an Array	Hard	dynamic programming
2552	Count Increasing Quadruplets	Hard	dynamic programming
2556	Disconnect Path in a Binary Matrix by at Most One Flip	Medium	dynamic programming
2565	Subsequence With the Minimum Score	Hard	dynamic programming
2572	Count the Number of Square-Free Subsets	Medium	dynamic programming
2585	Number of Ways to Earn Points	Hard	dynamic programming
2597	The Number of Beautiful Subsets	Medium	dynamic programming
2638	Count the Number of K-Free Subsets	Medium	dynamic programming
2646	Minimize the Total Price of the Trips	Hard	dynamic programming
2681	Power of Heroes	Hard	dynamic programming
2684	Maximum Number of Moves in a Grid	Medium	dynamic programming
2707	Extra Characters in a String	Medium	dynamic programming
2713	Maximum Strictly Increasing Cells in a Matrix	Hard	dynamic programming
2719	Count of Integers	Hard	dynamic programming
2742	Painting the Walls	Hard	dynamic programming
2746	Decremental String Concatenation	Medium	dynamic programming
2767	Partition String Into Minimum Beautiful Substrings	Medium	dynamic programming
2770	Maximum Number of Jumps to Reach the Last Index	Medium	dynamic programming
2771	Longest Non-decreasing Subarray From Two Arrays	Medium	dynamic programming
2786	Visit Array Positions to Maximize Score	Medium	dynamic programming
2787	Ways to Express an Integer as Sum of Powers	Medium	dynamic programming
2801	Count Stepping Numbers in Range	Hard	dynamic programming
2809	Minimum Time to Make Array Sum At Most x	Hard	dynamic programming
2826	Sorting Three Groups	Medium	dynamic programming
2827	Number of Beautiful Integers in the Range	Hard	dynamic programming
2830	Maximize the Profit as the Salesman	Medium	dynamic programming
2858	Minimum Edge Reversals So Every Node Is Reachable	Hard	dynamic programming
2867	Count Valid Paths in a Tree	Hard	dynamic programming
2896	Apply Operations to Make Two Strings Equal	Medium	dynamic programming
2901	Longest Unequal Adjacent Groups Subsequence II	Medium	dynamic programming
2902	Count of Sub-Multisets With Bounded Sum	Hard	dynamic programming
2911	Minimum Changes to Make K Semi-palindromes	Hard	dynamic programming
2912	Number of Ways to Reach Destination in the Grid	Hard	dynamic programming
2913	Subarrays Distinct Element Sum of Squares I	Easy	dynamic programming
2915	Length of the Longest Subsequence That Sums to Target	Medium	dynamic programming
2916	Subarrays Distinct Element Sum of Squares II	Easy	dynamic programming
2919	Minimum Increment Operations to Make Array Beautiful	Medium	dynamic programming
2920	Maximum Points After Collecting Coins From All Nodes	Hard	dynamic programming
2925	Maximum Score After Applying Operations on a Tree	Medium	dynamic programming
2941	Maximum GCD-Sum of a Subarray	Hard	dynamic programming
2944	Minimum Number of Coins for Fruits	Medium	dynamic programming
2945	Find Maximum Non-decreasing Array Length	Hard	dynamic programming
2969	Minimum Number of Coins for Fruits II	Hard	dynamic programming
2976	Minimum Cost to Convert String I	Medium	dynamic programming
2977	Minimum Cost to Convert String II	Hard	dynamic programming
2992	Number of Self-Divisible Permutations	Medium	dynamic programming
2998	Minimum Number of Operations to Make X and Y Equal	Medium	dynamic programming
3018	Maximum Number of Removal Queries That Can Be Processed I	Hard	dynamic programming
3020	Find the Maximum Number of Elements in Subset	Medium	dynamic programming
3040	Maximum Number of Operations With the Same Score II	Medium	dynamic programming
3041	Maximize Consecutive Elements in an Array After Modification	Hard	dynamic programming
3077	Maximum Strength of K Disjoint Subarrays	Hard	dynamic programming
3082	Find the Sum of the Power of All Subsequences	Hard	dynamic programming
3098	Find the Sum of Subsequence Powers	Hard	dynamic programming
3101	Count Alternating Subarrays	Medium	dynamic programming
3117	Minimum Sum of Values by Dividing Array	Hard	dynamic programming
3122	Minimum Number of Operations to Satisfy Conditions	Medium	dynamic programming
3129	Find All Possible Stable Binary Arrays I	Medium	dynamic programming
3130	Find All Possible Stable Binary Arrays II	Hard	dynamic programming
3141	Maximum Hamming Distances	Hard	dynamic programming
3144	Minimum Substring Partition of Equal Character Frequency	Medium	dynamic programming
3148	Maximum Difference Score in a Grid	Medium	dynamic programming
3149	Find the Minimum Cost Array Permutation	Hard	dynamic programming
3176	Find the Maximum Length of a Good Subsequence I	Medium	dynamic programming
3177	Find the Maximum Length of a Good Subsequence II	Hard	dynamic programming
3180	Maximum Total Reward Using Operations I	Medium	dynamic programming
3181	Maximum Total Reward Using Operations II	Hard	dynamic programming
3186	Maximum Total Damage With Spell Casting	Medium	dynamic programming
3193	Count the Number of Inversions	Hard	dynamic programming
3196	Maximize Total Cost of Alternating Subarrays	Medium	dynamic programming
3197	Find the Minimum Area to Cover All Ones II	Hard	dynamic programming
3201	Find the Maximum Length of Valid Subsequence I	Medium	dynamic programming
3202	Find the Maximum Length of Valid Subsequence II	Medium	dynamic programming
3209	Number of Subarrays With AND Value of K	Hard	dynamic programming
3212	Count Submatrices With Equal Frequency of X and Y	Medium	dynamic programming
3213	Construct String with Minimum Cost	Hard	dynamic programming
3225	Maximum Score From Grid Operations	Hard	dynamic programming
3241	Time Taken to Mark All Nodes	Hard	dynamic programming
3253	Construct String with Minimum Cost (Easy)	Medium	dynamic programming
3259	Maximum Energy Boost From Two Drinks	Medium	dynamic programming
3269	Constructing Two Increasing Arrays	Hard	dynamic programming
3277	Maximum XOR Score Subarray Queries	Hard	dynamic programming
3283	Maximum Number of Moves to Kill All Pawns	Hard	dynamic programming
3287	Find the Maximum Sequence Value of Array	Hard	dynamic programming
3290	Maximum Multiplication Score	Medium	dynamic programming
3291	Minimum Number of Valid Strings to Form Target I	Medium	dynamic programming
3292	Minimum Number of Valid Strings to Form Target II	Hard	dynamic programming
3313	Find the Last Marked Nodes in Tree	Hard	dynamic programming
3316	Find Maximum Removals From Source String	Medium	dynamic programming
3320	Count The Number of Winning Sequences	Hard	dynamic programming
3332	Maximum Points Tourist Can Earn	Hard	dynamic programming
3333	Find the Original Typed String II	Hard	dynamic programming
3335	Total Characters in String After Transformations I	Medium	dynamic programming
3336	Find the Number of Subsequences With Equal GCD	Hard	dynamic programming
3337	Total Characters in String After Transformations II	Hard	dynamic programming
3343	Count Number of Balanced Permutations	Hard	dynamic programming
3351	Sum of Good Subsequences	Hard	dynamic programming
3352	Count K-Reducible Numbers Less Than N	Hard	dynamic programming
3359	Find Sorted Submatrices With Maximum Element at Most K	Hard	dynamic programming
3363	Find the Maximum Number of Fruits Collected	Hard	dynamic programming
3366	Minimum Array Sum	Medium	dynamic programming
3372	Maximize the Number of Target Nodes After Connecting Trees I	Medium	dynamic programming
3381	Maximum Subarray Sum With Length Divisible by K	Medium	dynamic programming
3388	Count Beautiful Splits in an Array	Medium	dynamic programming
3389	Minimum Operations to Make Character Frequencies Equal	Hard	dynamic programming
3393	Count Paths With the Given XOR Value	Medium	dynamic programming
3409	Longest Subsequence With Decreasing Adjacent Difference	Medium	dynamic programming
3414	Maximum Score of Non-overlapping Intervals	Hard	dynamic programming
3418	Maximum Amount of Money Robot Can Earn	Medium	dynamic programming
3429	Paint House IV	Medium	dynamic programming
3434	Maximum Frequency After Subarray Operation	Medium	dynamic programming
3441	Minimum Cost Good Caption	Hard	dynamic programming
3444	Minimum Increments for Target Multiples in an Array	Hard	dynamic programming
3459	Length of Longest V-Shaped Diagonal Segment	Hard	dynamic programming
3466	Maximum Coin Collection	Medium	dynamic programming
3469	Find Minimum Cost to Remove Array Elements	Medium	dynamic programming
3472	Longest Palindromic Subsequence After at Most K Operations	Medium	dynamic programming
3473	Sum of K Subarrays With Length at Least M	Medium	dynamic programming
3489	Zero Array Transformation IV	Medium	dynamic programming
3490	Count Beautiful Numbers	Hard	dynamic programming
3500	Minimum Cost to Divide Array Into Subarrays	Hard	dynamic programming
3503	Longest Palindrome After Substring Concatenation I	Medium	dynamic programming
3504	Longest Palindrome After Substring Concatenation II	Hard	dynamic programming
3505	Minimum Operations to Make Elements Within K Subarrays Equal	Hard	dynamic programming
3509	Maximum Product of Subsequences With an Alternating Sum Equal to K	Hard	dynamic programming
3524	Find X Value of Array I	Medium	dynamic programming
3525	Find X Value of Array II	Hard	dynamic programming
3530	Maximum Profit from Valid Topological Order in DAG	Hard	dynamic programming
3533	Concatenated Divisibility	Hard	dynamic programming
3538	Merge Operations for Minimum Travel Time	Hard	dynamic programming
3539	Find Sum of Array Product of Magical Sequences	Hard	dynamic programming
3543	Maximum Weighted K-Edge Path	Medium	dynamic programming
3544	Subtree Inversion Sum	Hard	dynamic programming
3562	Maximum Profit from Trading Stocks with Discounts	Hard	dynamic programming
3563	Lexicographically Smallest String After Adjacent Removals	Hard	dynamic programming
3573	Best Time to Buy and Sell Stock V	Medium	dynamic programming
3574	Maximize Subarray GCD Score	Hard	dynamic programming
3575	Maximum Good Subtree Score	Hard	dynamic programming
3578	Count Partitions With Max-Min Difference at Most K	Medium	dynamic programming
3579	Minimum Steps to Convert String with Operations	Hard	dynamic programming
3583	Count Special Triplets	Medium	dynamic programming
3592	Inverse Coin Change	Medium	dynamic programming
3595	Once Twice	Medium	dynamic programming
3599	Partition Array to Minimize XOR	Medium	dynamic programming
3603	Minimum Cost Path with Alternating Directions II	Medium	dynamic programming
3610	Minimum Number of Primes to Sum to Target	Medium	dynamic programming
3615	Longest Palindromic Path in Graph	Hard	dynamic programming
3628	Maximum Number of Subsequences After One Inserting	Medium	dynamic programming
3647	Maximum Weight in Two Bags	Medium	dynamic programming
3651	Minimum Cost Path with Teleportations	Hard	dynamic programming
3654	Minimum Sum After Divisible Sum Deletions	Medium	dynamic programming
3661	Maximum Walls Destroyed by Robots	Hard	dynamic programming
3665	Twisted Mirror Path Count	Medium	dynamic programming
3670	Maximum Product of Two Integers With No Common Bits	Medium	dynamic programming
3685	Subsequence Sum After Capping Elements	Medium	dynamic programming
3686	Number of Stable Subsequences	Hard	dynamic programming
3693	Climbing Stairs II	Medium	dynamic programming
3699	Number of ZigZag Arrays I	Hard	dynamic programming
3704	Count No-Zero Pairs That Sum to N	Hard	dynamic programming
3717	Minimum Operations to Make the Array Beautiful	Medium	dynamic programming
3725	Count Ways to Choose Coprime Integers from Rows	Hard	dynamic programming
3742	Maximum Path Score in a Grid	Medium	dynamic programming
3743	Maximize Cyclic Partition Score	Hard	dynamic programming
3753	Total Waviness of Numbers in Range II	Hard	dynamic programming
3757	Number of Effective Subsequences	Hard	dynamic programming
3772	Maximum Subgraph Score in a Tree	Hard	dynamic programming
3791	Number of Balanced Integers in a Range	Hard	dynamic programming
3801	Minimum Cost to Merge Sorted Lists	Hard	dynamic programming
3811	Number of Alternating XOR Partitions	Medium	dynamic programming
3830	Longest Alternating Subarray After Removing At Most One Element	Hard	dynamic programming
3836	Maximum Score Using Exactly K Pairs	Hard	dynamic programming
3840	House Robber V	Medium	dynamic programming
3850	Count Sequences to K	Hard	dynamic programming
3864	Minimum Cost to Partition a Binary String	Hard	dynamic programming
3869	Count Fancy Numbers in a Range	Hard	dynamic programming
3877	Minimum Removals to Achieve Target XOR	Medium	dynamic programming
3882	Minimum XOR Path in a Grid	Medium	dynamic programming
3883	Count Non Decreasing Arrays With Given Digit Sums	Medium	dynamic programming
3891	Minimum Increase to Maximize Special Indices	Medium	dynamic programming
3906	Count Good Integers on a Grid Path	Hard	dynamic programming
3916	Number of ZigZag Arrays III	Hard	dynamic programming
3939	Count Non Adjacent Subsets in a Rooted Tree	Hard	dynamic programming
3946	Maximum Number of Items From Sale I	Medium	dynamic programming
3949	Subtree Inversion Sum II	Hard	dynamic programming
3953	Maximum Score with Co-Prime Element	Hard	dynamic programming
3965	Finish Time of Tasks I	Medium	dynamic programming
3966	Count Good Integers in a Range	Hard	dynamic programming
3967	Finish Time of Tasks II	Hard	dynamic programming
3976	Maximum Subarray Sum After Multiplier	Medium	dynamic programming
3981	Count Distinct Ways to Form Target from Two Strings	Hard	dynamic programming
3983	Subsequence After One Replacement	Medium	dynamic programming
3989	Maximum Consistent Columns in a Grid	Hard	dynamic programming