Dynamic Programming Problems
530 Dynamic Programming LeetCode problems · Browse tasks by difficulty and choose your next practice problem.
Learn the coding interview patterns behind these problems, including Dynamic Programming interview patterns.
Start with these
5 Longest Palindromic Substring Medium42 Trapping Rain Water Hard53 Maximum Subarray Medium55 Jump Game Medium62 Unique Paths Medium70 Climbing Stairs Easy91 Decode Ways Medium121 Best Time to Buy and Sell Stock Easy122 Best Time to Buy and Sell Stock II Medium124 Binary Tree Maximum Path Sum Hard139 Word Break Medium152 Maximum Product Subarray Medium198 House Robber Medium213 House Robber II Medium221 Maximal Square Medium300 Longest Increasing Subsequence Medium322 Coin Change Medium338 Counting Bits Easy435 Non-overlapping Intervals Medium647 Palindromic Substrings Medium1143 Longest Common Subsequence Medium1621 Number of Sets of K Non-Overlapping Line Segments Medium1959 Minimum Total Space Wasted With K Resizing Operations Medium3225 Maximum Score From Grid Operations Hard3256 Maximum Value Sum by Placing Three Rooks I Hard3291 Minimum Number of Valid Strings to Form Target I Medium3292 Minimum Number of Valid Strings to Form Target II Hard3320 Count The Number of Winning Sequences Hard3524 Find X Value of Array I Medium3559 Number of Ways to Assign Edge Weights II Hard3615 Longest Palindromic Path in Graph Hard
All Dynamic Programming problems
5 Longest Palindromic Substring Medium10 Regular Expression Matching Hard22 Generate Parentheses Medium32 Longest Valid Parentheses Hard42 Trapping Rain Water Hard44 Wildcard Matching Hard45 Jump Game II Medium53 Maximum Subarray Medium55 Jump Game Medium62 Unique Paths Medium63 Unique Paths II Medium64 Minimum Path Sum Medium70 Climbing Stairs Easy72 Edit Distance Medium85 Maximal Rectangle Hard87 Scramble String Hard91 Decode Ways Medium95 Unique Binary Search Trees II Medium96 Unique Binary Search Trees Medium97 Interleaving String Medium115 Distinct Subsequences Hard118 Pascal's Triangle Easy119 Pascal's Triangle II Easy120 Triangle Medium121 Best Time to Buy and Sell Stock Easy122 Best Time to Buy and Sell Stock II Medium123 Best Time to Buy and Sell Stock III Hard124 Binary Tree Maximum Path Sum Hard131 Palindrome Partitioning Medium132 Palindrome Partitioning II Hard139 Word Break Medium140 Word Break II Hard152 Maximum Product Subarray Medium174 Dungeon Game Hard188 Best Time to Buy and Sell Stock IV Hard198 House Robber Medium213 House Robber II Medium221 Maximal Square Medium233 Number of Digit One Hard241 Different Ways to Add Parentheses Medium264 Ugly Number II Medium279 Perfect Squares Medium300 Longest Increasing Subsequence Medium309 Best Time to Buy and Sell Stock with Cooldown Medium312 Burst Balloons Hard313 Super Ugly Number Medium322 Coin Change Medium329 Longest Increasing Path in a Matrix Hard337 House Robber III Medium338 Counting Bits Easy343 Integer Break Medium354 Russian Doll Envelopes Hard357 Count Numbers with Unique Digits Medium368 Largest Divisible Subset Medium375 Guess Number Higher or Lower II Medium376 Wiggle Subsequence Medium377 Combination Sum IV Medium392 Is Subsequence Easy396 Rotate Function Medium397 Integer Replacement Medium403 Frog Jump Hard410 Split Array Largest Sum Hard413 Arithmetic Slices Medium416 Partition Equal Subset Sum Medium435 Non-overlapping Intervals Medium446 Arithmetic Slices II - Subsequence Hard458 Poor Pigs Hard464 Can I Win Medium466 Count The Repetitions Hard467 Unique Substrings in Wraparound String Medium472 Concatenated Words Hard473 Matchsticks to Square Medium474 Ones and Zeroes Medium486 Predict the Winner Medium488 Zuma Game Hard494 Target Sum Medium509 Fibonacci Number Easy514 Freedom Trail Hard516 Longest Palindromic Subsequence Medium518 Coin Change II Medium526 Beautiful Arrangement Medium542 01 Matrix Medium546 Remove Boxes Hard552 Student Attendance Record II Hard553 Optimal Division Medium576 Out of Boundary Paths Medium583 Delete Operation for Two Strings Medium600 Non-negative Integers without Consecutive Ones Hard629 K Inverse Pairs Array Hard638 Shopping Offers Medium639 Decode Ways II Hard646 Maximum Length of Pair Chain Medium647 Palindromic Substrings Medium650 2 Keys Keyboard Medium664 Strange Printer Hard673 Number of Longest Increasing Subsequence Medium678 Valid Parenthesis String Medium688 Knight Probability in Chessboard Medium689 Maximum Sum of 3 Non-Overlapping Subarrays Hard691 Stickers to Spell Word Hard698 Partition to K Equal Sum Subsets Medium712 Minimum ASCII Delete Sum for Two Strings Medium714 Best Time to Buy and Sell Stock with Transaction Fee Medium718 Maximum Length of Repeated Subarray Medium730 Count Different Palindromic Subsequences Hard740 Delete and Earn Medium741 Cherry Pickup Hard746 Min Cost Climbing Stairs Easy764 Largest Plus Sign Medium773 Sliding Puzzle Hard787 Cheapest Flights Within K Stops Medium788 Rotated Digits Medium790 Domino and Tromino Tiling Medium792 Number of Matching Subsequences Medium799 Champagne Tower Medium801 Minimum Swaps To Make Sequences Increasing Hard805 Split Array With Same Average Hard808 Soup Servings Medium813 Largest Sum of Averages Medium818 Race Car Hard823 Binary Trees With Factors Medium828 Count Unique Characters of All Substrings of a Given String Hard834 Sum of Distances in Tree Hard837 New 21 Game Medium838 Push Dominoes Medium845 Longest Mountain in Array Medium847 Shortest Path Visiting All Nodes Hard871 Minimum Number of Refueling Stops Hard873 Length of Longest Fibonacci Subsequence Medium877 Stone Game Medium879 Profitable Schemes Hard887 Super Egg Drop Hard894 All Possible Full Binary Trees Medium898 Bitwise ORs of Subarrays Medium902 Numbers At Most N Given Digit Set Hard903 Valid Permutations for DI Sequence Hard907 Sum of Subarray Minimums Medium913 Cat and Mouse Hard918 Maximum Sum Circular Subarray Medium920 Number of Music Playlists Hard926 Flip String to Monotone Increasing Medium931 Minimum Falling Path Sum Medium935 Knight Dialer Medium940 Distinct Subsequences II Hard943 Find the Shortest Superstring Hard956 Tallest Billboard Hard960 Delete Columns to Make Sorted III Hard964 Least Operators to Express Number Hard968 Binary Tree Cameras Hard975 Odd Even Jump Hard978 Longest Turbulent Subarray Medium983 Minimum Cost For Tickets Medium996 Number of Squareful Arrays Hard1000 Minimum Cost to Merge Stones Hard1012 Numbers With Repeated Digits Hard1014 Best Sightseeing Pair Medium1024 Video Stitching Medium1025 Divisor Game Easy1027 Longest Arithmetic Subsequence Medium1031 Maximum Sum of Two Non-Overlapping Subarrays Medium1035 Uncrossed Lines Medium1039 Minimum Score Triangulation of Polygon Medium1043 Partition Array for Maximum Sum Medium1048 Longest String Chain Medium1049 Last Stone Weight II Medium1092 Shortest Common Supersequence Hard1105 Filling Bookcase Shelves Medium1125 Smallest Sufficient Team Hard1130 Minimum Cost Tree From Leaf Values Medium1137 N-th Tribonacci Number Easy1139 Largest 1-Bordered Square Medium1140 Stone Game II Medium1143 Longest Common Subsequence Medium1147 Longest Chunked Palindrome Decomposition Hard1155 Number of Dice Rolls With Target Sum Medium1162 As Far from Land as Possible Medium1186 Maximum Subarray Sum with One Deletion Medium1187 Make Array Strictly Increasing Hard1191 K-Concatenation Maximum Sum Medium1218 Longest Arithmetic Subsequence of Given Difference Medium1220 Count Vowels Permutation Hard1223 Dice Roll Simulation Hard1227 Airplane Seat Assignment Probability Medium1235 Maximum Profit in Job Scheduling Hard1255 Maximum Score Words Formed by Letters Hard1262 Greatest Sum Divisible by Three Medium1269 Number of Ways to Stay in the Same Place After Some Steps Hard1277 Count Square Submatrices with All Ones Medium1278 Palindrome Partitioning III Hard1289 Minimum Falling Path Sum II Hard1301 Number of Paths with Max Score Hard1312 Minimum Insertion Steps to Make a String Palindrome Hard1320 Minimum Distance to Type a Word Using Two Fingers Hard1326 Minimum Number of Taps to Open to Water a Garden Hard1334 Find the City With the Smallest Number of Neighbors at a Threshold Distance Medium1335 Minimum Difficulty of a Job Schedule Hard1340 Jump Game V Hard1349 Maximum Students Taking Exam Hard1359 Count All Valid Pickup and Delivery Options Hard1363 Largest Multiple of Three Hard1372 Longest ZigZag Path in a Binary Tree Medium1373 Maximum Sum BST in Binary Tree Hard1387 Sort Integers by The Power Value Medium1388 Pizza With 3n Slices Hard1395 Count Number of Teams Medium1397 Find All Good Strings Hard1402 Reducing Dishes Hard1406 Stone Game III Hard1411 Number of Ways to Paint N × 3 Grid Hard1416 Restore The Array Hard1420 Build Array Where You Can Find The Maximum Exactly K Comparisons Hard1425 Constrained Subsequence Sum Hard1434 Number of Ways to Wear Different Hats to Each Other Hard1444 Number of Ways of Cutting a Pizza Hard1449 Form Largest Integer With Digits That Add up to Target Hard1458 Max Dot Product of Two Subsequences Hard1463 Cherry Pickup II Hard1467 Probability of a Two Boxes Having The Same Number of Distinct Balls Hard1473 Paint House III Hard1477 Find Two Non-overlapping Sub-arrays Each With Target Sum Medium1478 Allocate Mailboxes Hard1483 Kth Ancestor of a Tree Node Hard1493 Longest Subarray of 1's After Deleting One Element Medium1494 Parallel Courses II Hard1504 Count Submatrices With All Ones Medium1510 Stone Game IV Hard1524 Number of Sub-arrays With Odd Sum Medium1525 Number of Good Ways to Split a String Medium1526 Minimum Number of Increments on Subarrays to Form a Target Array Hard1531 String Compression II Hard1537 Get the Maximum Score Hard1547 Minimum Cost to Cut a Stick Hard1553 Minimum Number of Days to Eat N Oranges Hard1563 Stone Game V Hard1567 Maximum Length of Subarray With Positive Product Medium1569 Number of Ways to Reorder Array to Get Same BST Hard1575 Count All Possible Routes Hard1578 Minimum Time to Make Rope Colorful Medium1594 Maximum Non Negative Product in a Matrix Medium1595 Minimum Cost to Connect Two Groups of Points Hard1611 Minimum One Bit Operations to Make Integers Zero Hard1617 Count Subtrees With Max Distance Between Cities Hard1621 Number of Sets of K Non-Overlapping Line Segments Medium1626 Best Team With No Conflicts Medium1638 Count Substrings That Differ by One Character Medium1639 Number of Ways to Form a Target String Given a Dictionary Hard1641 Count Sorted Vowel Strings Medium1643 Kth Smallest Instructions Hard1653 Minimum Deletions to Make String Balanced Medium1654 Minimum Jumps to Reach Home Medium1655 Distribute Repeating Integers Hard1659 Maximize Grid Happiness Hard1668 Maximum Repeating Substring Easy1671 Minimum Number of Removals to Make Mountain Array Hard1681 Minimum Incompatibility Hard1687 Delivering Boxes from Storage to Ports Hard1690 Stone Game VII Medium1691 Maximum Height by Stacking Cuboids Hard1696 Jump Game VI Medium1723 Find Minimum Time to Finish All Jobs Hard1728 Cat and Mouse II Hard1735 Count Ways to Make Array With Product Hard1745 Palindrome Partitioning IV Hard1749 Maximum Absolute Sum of Any Subarray Medium1751 Maximum Number of Events That Can Be Attended II Hard1755 Closest Subsequence Sum Hard1770 Maximum Score from Performing Multiplication Operations Hard1771 Maximize Palindrome Length From Subsequences Hard1774 Closest Dessert Cost Medium1786 Number of Restricted Paths From First to Last Node Medium1787 Make the XOR of All Segments Equal to Zero Hard1799 Maximize Score After N Operations Hard1815 Maximum Number of Groups Getting Fresh Donuts Hard1824 Minimum Sideway Jumps Medium1857 Largest Color Value in a Directed Graph Hard1866 Number of Ways to Rearrange Sticks With K Sticks Visible Hard1871 Jump Game VII Medium1872 Stone Game VIII Hard1879 Minimum XOR Sum of Two Arrays Hard1883 Minimum Skips to Arrive at Meeting On Time Hard1884 Egg Drop With 2 Eggs and N Floors Medium1888 Minimum Number of Flips to Make the Binary String Alternating Medium1896 Minimum Cost to Change the Final Value of Expression Hard1900 The Earliest and Latest Rounds Where Players Compete Hard1911 Maximum Alternating Subsequence Sum Medium1916 Count Ways to Build Rooms in an Ant Colony Hard1928 Minimum Cost to Reach Destination in Time Hard1931 Painting a Grid With Three Different Colors Hard1937 Maximum Number of Points with Cost Medium1947 Maximum Compatibility Score Sum Medium1955 Count Number of Special Subsequences Hard1959 Minimum Total Space Wasted With K Resizing Operations Medium1976 Number of Ways to Arrive at Destination Medium1977 Number of Ways to Separate Numbers Hard1981 Minimize the Difference Between Target and Chosen Elements Medium1986 Minimum Number of Work Sessions to Finish the Tasks Medium1987 Number of Unique Good Subsequences Hard1994 The Number of Good Subsets Hard1997 First Day Where You Have Been in All the Rooms Medium2002 Maximum Product of the Length of Two Palindromic Subsequences Medium2003 Smallest Missing Genetic Value in Each Subtree Hard2008 Maximum Earnings From Taxi Medium2019 The Score of Students Solving Math Expression Hard2035 Partition Array Into Two Arrays to Minimize Sum Difference Hard2050 Parallel Courses III Hard2054 Two Best Non-Overlapping Events Medium2060 Check if an Original String Exists Given Two Encoded Strings Hard2063 Vowels of All Substrings Medium2086 Minimum Number of Food Buckets to Feed the Hamsters Medium2088 Count Fertile Pyramids in a Land Hard2100 Find Good Days to Rob the Bank Medium2110 Number of Smooth Descent Periods of a Stock Medium2140 Solving Questions With Brainpower Medium2147 Number of Ways to Divide a Long Corridor Hard2163 Minimum Difference in Sums After Removal of Elements Hard2167 Minimum Time to Remove All Cars Containing Illegal Goods Hard2172 Maximum AND Sum of Array Hard2188 Minimum Time to Finish the Race Hard2209 Minimum White Tiles After Covering With Carpets Hard2218 Maximum Value of K Coins From Piles Hard2222 Number of Ways to Select Buildings Medium2262 Total Appeal of A String Hard2266 Count Number of Texts Medium2267 Check if There Is a Valid Parentheses String Path Hard2272 Substring With Largest Variance Hard2304 Minimum Path Cost in a Grid Medium2305 Fair Distribution of Cookies Medium2310 Sum of Numbers With Units Digit K Medium2311 Longest Binary Subsequence Less Than or Equal to K Medium2312 Selling Pieces of Wood Hard2318 Number of Distinct Roll Sequences Hard2320 Count Number of Ways to Place Houses Medium2321 Maximum Score Of Spliced Array Hard2327 Number of People Aware of a Secret Medium2328 Number of Increasing Paths in a Grid Hard2338 Count the Number of Ideal Arrays Hard2369 Check if There is a Valid Partition For The Array Medium2370 Longest Ideal Subsequence Medium2376 Count Special Integers Hard2380 Time Needed to Rearrange a Binary String Medium2400 Number of Ways to Reach a Position After Exactly k Steps Medium2407 Longest Increasing Subsequence II Hard2420 Find All Good Indices Medium2430 Maximum Deletions on a String Hard2435 Paths in Matrix Whose Sum Is Divisible by K Hard2439 Minimize Maximum of Array Medium2463 Minimum Total Distance Traveled Hard2466 Count Ways To Build Good Strings Medium2472 Maximum Number of Non-overlapping Palindrome Substrings Hard2478 Number of Beautiful Partitions Hard2484 Count Palindromic Subsequences Hard2501 Longest Square Streak in an Array Medium2518 Number of Great Partitions Hard2522 Partition String Into Substrings With Values at Most K Medium2538 Difference Between Maximum and Minimum Price Sum Hard2547 Minimum Cost to Split an Array Hard2552 Count Increasing Quadruplets Hard2556 Disconnect Path in a Binary Matrix by at Most One Flip Medium2560 House Robber IV Medium2571 Minimum Operations to Reduce an Integer to 0 Medium2572 Count the Number of Square-Free Subsets Medium2573 Find the String with LCP Hard2581 Count Number of Possible Root Nodes Hard2585 Number of Ways to Earn Points Hard2597 The Number of Beautiful Subsets Medium2606 Find the Substring With Maximum Cost Medium2616 Minimize the Maximum Difference of Pairs Medium2617 Minimum Number of Visited Cells in a Grid Hard2645 Minimum Additions to Make Valid String Medium2646 Minimize the Total Price of the Trips Hard2673 Make Costs of Paths Equal in a Binary Tree Medium2681 Power of Heroes Hard2684 Maximum Number of Moves in a Grid Medium2707 Extra Characters in a String Medium2708 Maximum Strength of a Group Medium2712 Minimum Cost to Make All Characters Equal Medium2713 Maximum Strictly Increasing Cells in a Matrix Hard2719 Count of Integers Hard2741 Special Permutations Medium2742 Painting the Walls Hard2745 Construct the Longest New String Medium2746 Decremental String Concatenation Medium2750 Ways to Split Array Into Good Subarrays Medium2767 Partition String Into Minimum Beautiful Substrings Medium2770 Maximum Number of Jumps to Reach the Last Index Medium2771 Longest Non-decreasing Subarray From Two Arrays Medium2786 Visit Array Positions to Maximize Score Medium2787 Ways to Express an Integer as Sum of Powers Medium2791 Count Paths That Can Form a Palindrome in a Tree Hard2801 Count Stepping Numbers in Range Hard2809 Minimum Time to Make Array Sum At Most x Hard2811 Check if it is Possible to Split Array Medium2826 Sorting Three Groups Medium2827 Number of Beautiful Integers in the Range Hard2830 Maximize the Profit as the Salesman Medium2836 Maximize Value of Function in a Ball Passing Game Hard2850 Minimum Moves to Spread Stones Over Grid Medium2851 String Transformation Hard2858 Minimum Edge Reversals So Every Node Is Reachable Hard2867 Count Valid Paths in a Tree Hard2876 Count Visited Nodes in a Directed Graph Hard2896 Apply Operations to Make Two Strings Equal Medium2900 Longest Unequal Adjacent Groups Subsequence I Easy2901 Longest Unequal Adjacent Groups Subsequence II Medium2902 Count of Sub-Multisets With Bounded Sum Hard2911 Minimum Changes to Make K Semi-palindromes Hard2915 Length of the Longest Subsequence That Sums to Target Medium2916 Subarrays Distinct Element Sum of Squares II Hard2919 Minimum Increment Operations to Make Array Beautiful Medium2920 Maximum Points After Collecting Coins From All Nodes Hard2925 Maximum Score After Applying Operations on a Tree Medium2926 Maximum Balanced Subsequence Sum Hard2930 Number of Strings Which Can Be Rearranged to Contain Substring Medium2944 Minimum Number of Coins for Fruits Medium2945 Find Maximum Non-decreasing Array Length Hard2957 Remove Adjacent Almost-Equal Characters Medium2973 Find Number of Coins to Place in Tree Nodes Hard2977 Minimum Cost to Convert String II Hard2998 Minimum Number of Operations to Make X and Y Equal Medium2999 Count the Number of Powerful Integers Hard3003 Maximize the Number of Partitions After Operations Hard3007 Maximum Number That Sum of the Prices Is Less Than or Equal to K Medium3040 Maximum Number of Operations With the Same Score II Medium3041 Maximize Consecutive Elements in an Array After Modification Hard3068 Find the Maximum Sum of Node Values Hard3077 Maximum Strength of K Disjoint Subarrays Hard3082 Find the Sum of the Power of All Subsequences Hard3098 Find the Sum of Subsequence Powers Hard3117 Minimum Sum of Values by Dividing Array Hard3122 Minimum Number of Operations to Satisfy Conditions Medium3129 Find All Possible Stable Binary Arrays I Medium3130 Find All Possible Stable Binary Arrays II Hard3144 Minimum Substring Partition of Equal Character Frequency Medium3148 Maximum Difference Score in a Grid Medium3149 Find the Minimum Cost Array Permutation Hard3154 Find Number of Ways to Reach the K-th Stair Hard3165 Maximum Sum of Subsequence With Non-adjacent Elements Hard3176 Find the Maximum Length of a Good Subsequence I Medium3177 Find the Maximum Length of a Good Subsequence II Hard3180 Maximum Total Reward Using Operations I Medium3181 Maximum Total Reward Using Operations II Hard3186 Maximum Total Damage With Spell Casting Medium3192 Minimum Operations to Make Binary Array Elements Equal to One II Medium3193 Count the Number of Inversions Hard3196 Maximize Total Cost of Alternating Subarrays Medium3201 Find the Maximum Length of Valid Subsequence I Medium3202 Find the Maximum Length of Valid Subsequence II Medium3213 Construct String with Minimum Cost Hard3218 Minimum Cost for Cutting Cake I Medium3225 Maximum Score From Grid Operations Hard3229 Minimum Operations to Make Array Equal to Target Hard3241 Time Taken to Mark All Nodes Hard3250 Find the Count of Monotonic Pairs I Hard3251 Find the Count of Monotonic Pairs II Hard3256 Maximum Value Sum by Placing Three Rooks I Hard3257 Maximum Value Sum by Placing Three Rooks II Hard3259 Maximum Energy Boost From Two Drinks Medium3260 Find the Largest Palindrome Divisible by K Hard3276 Select Cells in Grid With Maximum Score Hard3277 Maximum XOR Score Subarray Queries Hard3287 Find the Maximum Sequence Value of Array Hard3290 Maximum Multiplication Score Medium3291 Minimum Number of Valid Strings to Form Target I Medium3292 Minimum Number of Valid Strings to Form Target II Hard3302 Find the Lexicographically Smallest Valid Sequence Medium3316 Find Maximum Removals From Source String Medium3317 Find the Number of Possible Ways for an Event Hard3320 Count The Number of Winning Sequences Hard3332 Maximum Points Tourist Can Earn Medium3333 Find the Original Typed String II Hard3335 Total Characters in String After Transformations I Medium3336 Find the Number of Subsequences With Equal GCD Hard3337 Total Characters in String After Transformations II Hard3343 Count Number of Balanced Permutations Hard3351 Sum of Good Subsequences Hard3352 Count K-Reducible Numbers Less Than N Hard3363 Find the Maximum Number of Fruits Collected Hard3366 Minimum Array Sum Medium3367 Maximize Sum of Weights after Edge Removals Hard3376 Minimum Time to Break Locks I Medium3388 Count Beautiful Splits in an Array Medium3389 Minimum Operations to Make Character Frequencies Equal Hard3393 Count Paths With the Given XOR Value Medium3409 Longest Subsequence With Decreasing Adjacent Difference Medium3410 Maximize Subarray Sum After Removing All Occurrences of One Element Hard3414 Maximum Score of Non-overlapping Intervals Hard3418 Maximum Amount of Money Robot Can Earn Medium3428 Maximum and Minimum Sums of at Most Size K Subsequences Medium3429 Paint House IV Medium3434 Maximum Frequency After Subarray Operation Medium3441 Minimum Cost Good Caption Hard3444 Minimum Increments for Target Multiples in an Array Hard3448 Count Substrings Divisible By Last Digit Hard3458 Select K Disjoint Special Substrings Medium3459 Length of Longest V-Shaped Diagonal Segment Hard3469 Find Minimum Cost to Remove Array Elements Medium3472 Longest Palindromic Subsequence After at Most K Operations Medium3473 Sum of K Subarrays With Length at Least M Medium3489 Zero Array Transformation IV Medium3490 Count Beautiful Numbers Hard3500 Minimum Cost to Divide Array Into Subarrays Hard3503 Longest Palindrome After Substring Concatenation I Medium3504 Longest Palindrome After Substring Concatenation II Hard3505 Minimum Operations to Make Elements Within K Subarrays Equal Hard3509 Maximum Product of Subsequences With an Alternating Sum Equal to K Hard3519 Count Numbers with Non-Decreasing Digits Hard3524 Find X Value of Array I Medium3530 Maximum Profit from Valid Topological Order in DAG Hard3533 Concatenated Divisibility Hard3538 Merge Operations for Minimum Travel Time Hard3539 Find Sum of Array Product of Magical Sequences Hard3543 Maximum Weighted K-Edge Path Medium3544 Subtree Inversion Sum Hard3557 Find Maximum Number of Non Intersecting Substrings Medium3559 Number of Ways to Assign Edge Weights II Hard3562 Maximum Profit from Trading Stocks with Discounts Hard3563 Lexicographically Smallest String After Adjacent Removals Hard3573 Best Time to Buy and Sell Stock V Medium3575 Maximum Good Subtree Score Hard3578 Count Partitions With Max-Min Difference at Most K Medium3579 Minimum Steps to Convert String with Operations Hard3585 Find Weighted Median Node in Tree Hard3592 Inverse Coin Change Medium3593 Minimum Increments to Equalize Leaf Paths Medium3594 Minimum Time to Transport All Individuals Hard3599 Partition Array to Minimize XOR Medium3603 Minimum Cost Path with Alternating Directions II Medium3615 Longest Palindromic Path in Graph Hard3620 Network Recovery Pathways Hard3621 Number of Integers With Popcount-Depth Equal to K I Hard