PhantomCodeAI
Features
Mock Interview
Dashboard
Jobs
Pricing
Resources
Help
Features
Mock Interview
Dashboard
Jobs
Pricing
Resources
Help
PhantomCodeAI
Features
Mock Interview
Dashboard
Jobs
Pricing
Resources
Help
Features
Mock Interview
Dashboard
Jobs
Pricing
Resources
Help
Home
LeetCode Problems
Dynamic Programming
Dynamic Programming
Problems
530 Dynamic Programming LeetCode problems · Solve with AI-powered hints & step-by-step explanations.
5
Longest Palindromic Substring
Medium
10
Regular Expression Matching
Hard
22
Generate Parentheses
Medium
32
Longest Valid Parentheses
Hard
42
Trapping Rain Water
Hard
44
Wildcard Matching
Hard
45
Jump Game II
Medium
53
Maximum Subarray
Medium
55
Jump Game
Medium
62
Unique Paths
Medium
63
Unique Paths II
Medium
64
Minimum Path Sum
Medium
70
Climbing Stairs
Easy
72
Edit Distance
Medium
85
Maximal Rectangle
Hard
87
Scramble String
Hard
91
Decode Ways
Medium
95
Unique Binary Search Trees II
Medium
96
Unique Binary Search Trees
Medium
97
Interleaving String
Medium
115
Distinct Subsequences
Hard
118
Pascal's Triangle
Easy
119
Pascal's Triangle II
Easy
120
Triangle
Medium
121
Best Time to Buy and Sell Stock
Easy
122
Best Time to Buy and Sell Stock II
Medium
123
Best Time to Buy and Sell Stock III
Hard
124
Binary Tree Maximum Path Sum
Hard
131
Palindrome Partitioning
Medium
132
Palindrome Partitioning II
Hard
139
Word Break
Medium
140
Word Break II
Hard
152
Maximum Product Subarray
Medium
174
Dungeon Game
Hard
188
Best Time to Buy and Sell Stock IV
Hard
198
House Robber
Medium
213
House Robber II
Medium
221
Maximal Square
Medium
233
Number of Digit One
Hard
241
Different Ways to Add Parentheses
Medium
264
Ugly Number II
Medium
279
Perfect Squares
Medium
300
Longest Increasing Subsequence
Medium
309
Best Time to Buy and Sell Stock with Cooldown
Medium
312
Burst Balloons
Hard
313
Super Ugly Number
Medium
322
Coin Change
Medium
329
Longest Increasing Path in a Matrix
Hard
337
House Robber III
Medium
338
Counting Bits
Easy
343
Integer Break
Medium
354
Russian Doll Envelopes
Hard
357
Count Numbers with Unique Digits
Medium
368
Largest Divisible Subset
Medium
375
Guess Number Higher or Lower II
Medium
376
Wiggle Subsequence
Medium
377
Combination Sum IV
Medium
392
Is Subsequence
Easy
396
Rotate Function
Medium
397
Integer Replacement
Medium
403
Frog Jump
Hard
410
Split Array Largest Sum
Hard
413
Arithmetic Slices
Medium
416
Partition Equal Subset Sum
Medium
435
Non-overlapping Intervals
Medium
446
Arithmetic Slices II - Subsequence
Hard
458
Poor Pigs
Hard
464
Can I Win
Medium
466
Count The Repetitions
Hard
467
Unique Substrings in Wraparound String
Medium
472
Concatenated Words
Hard
473
Matchsticks to Square
Medium
474
Ones and Zeroes
Medium
486
Predict the Winner
Medium
488
Zuma Game
Hard
494
Target Sum
Medium
509
Fibonacci Number
Easy
514
Freedom Trail
Hard
516
Longest Palindromic Subsequence
Medium
518
Coin Change II
Medium
526
Beautiful Arrangement
Medium
542
01 Matrix
Medium
546
Remove Boxes
Hard
552
Student Attendance Record II
Hard
553
Optimal Division
Medium
576
Out of Boundary Paths
Medium
583
Delete Operation for Two Strings
Medium
600
Non-negative Integers without Consecutive Ones
Hard
629
K Inverse Pairs Array
Hard
638
Shopping Offers
Medium
639
Decode Ways II
Hard
646
Maximum Length of Pair Chain
Medium
647
Palindromic Substrings
Medium
650
2 Keys Keyboard
Medium
664
Strange Printer
Hard
673
Number of Longest Increasing Subsequence
Medium
678
Valid Parenthesis String
Medium
688
Knight Probability in Chessboard
Medium
689
Maximum Sum of 3 Non-Overlapping Subarrays
Hard
691
Stickers to Spell Word
Hard
698
Partition to K Equal Sum Subsets
Medium
712
Minimum ASCII Delete Sum for Two Strings
Medium
714
Best Time to Buy and Sell Stock with Transaction Fee
Medium
718
Maximum Length of Repeated Subarray
Medium
730
Count Different Palindromic Subsequences
Hard
740
Delete and Earn
Medium
741
Cherry Pickup
Hard
746
Min Cost Climbing Stairs
Easy
764
Largest Plus Sign
Medium
773
Sliding Puzzle
Hard
787
Cheapest Flights Within K Stops
Medium
788
Rotated Digits
Medium
790
Domino and Tromino Tiling
Medium
792
Number of Matching Subsequences
Medium
799
Champagne Tower
Medium
801
Minimum Swaps To Make Sequences Increasing
Hard
805
Split Array With Same Average
Hard
808
Soup Servings
Medium
813
Largest Sum of Averages
Medium
818
Race Car
Hard
823
Binary Trees With Factors
Medium
828
Count Unique Characters of All Substrings of a Given String
Hard
834
Sum of Distances in Tree
Hard
837
New 21 Game
Medium
838
Push Dominoes
Medium
845
Longest Mountain in Array
Medium
847
Shortest Path Visiting All Nodes
Hard
871
Minimum Number of Refueling Stops
Hard
873
Length of Longest Fibonacci Subsequence
Medium
877
Stone Game
Medium
879
Profitable Schemes
Hard
887
Super Egg Drop
Hard
894
All Possible Full Binary Trees
Medium
898
Bitwise ORs of Subarrays
Medium
902
Numbers At Most N Given Digit Set
Hard
903
Valid Permutations for DI Sequence
Hard
907
Sum of Subarray Minimums
Medium
913
Cat and Mouse
Hard
918
Maximum Sum Circular Subarray
Medium
920
Number of Music Playlists
Hard
926
Flip String to Monotone Increasing
Medium
931
Minimum Falling Path Sum
Medium
935
Knight Dialer
Medium
940
Distinct Subsequences II
Hard
943
Find the Shortest Superstring
Hard
956
Tallest Billboard
Hard
960
Delete Columns to Make Sorted III
Hard
964
Least Operators to Express Number
Hard
968
Binary Tree Cameras
Hard
975
Odd Even Jump
Hard
978
Longest Turbulent Subarray
Medium
983
Minimum Cost For Tickets
Medium
996
Number of Squareful Arrays
Hard
1000
Minimum Cost to Merge Stones
Hard
1012
Numbers With Repeated Digits
Hard
1014
Best Sightseeing Pair
Medium
1024
Video Stitching
Medium
1025
Divisor Game
Easy
1027
Longest Arithmetic Subsequence
Medium
1031
Maximum Sum of Two Non-Overlapping Subarrays
Medium
1035
Uncrossed Lines
Medium
1039
Minimum Score Triangulation of Polygon
Medium
1043
Partition Array for Maximum Sum
Medium
1048
Longest String Chain
Medium
1049
Last Stone Weight II
Medium
1092
Shortest Common Supersequence
Hard
1105
Filling Bookcase Shelves
Medium
1125
Smallest Sufficient Team
Hard
1130
Minimum Cost Tree From Leaf Values
Medium
1137
N-th Tribonacci Number
Easy
1139
Largest 1-Bordered Square
Medium
1140
Stone Game II
Medium
1143
Longest Common Subsequence
Medium
1147
Longest Chunked Palindrome Decomposition
Hard
1155
Number of Dice Rolls With Target Sum
Medium
1162
As Far from Land as Possible
Medium
1186
Maximum Subarray Sum with One Deletion
Medium
1187
Make Array Strictly Increasing
Hard
1191
K-Concatenation Maximum Sum
Medium
1218
Longest Arithmetic Subsequence of Given Difference
Medium
1220
Count Vowels Permutation
Hard
1223
Dice Roll Simulation
Hard
1227
Airplane Seat Assignment Probability
Medium
1235
Maximum Profit in Job Scheduling
Hard
1255
Maximum Score Words Formed by Letters
Hard
1262
Greatest Sum Divisible by Three
Medium
1269
Number of Ways to Stay in the Same Place After Some Steps
Hard
1277
Count Square Submatrices with All Ones
Medium
1278
Palindrome Partitioning III
Hard
1289
Minimum Falling Path Sum II
Hard
1301
Number of Paths with Max Score
Hard
1312
Minimum Insertion Steps to Make a String Palindrome
Hard
1320
Minimum Distance to Type a Word Using Two Fingers
Hard
1326
Minimum Number of Taps to Open to Water a Garden
Hard
1334
Find the City With the Smallest Number of Neighbors at a Threshold Distance
Medium
1335
Minimum Difficulty of a Job Schedule
Hard
1340
Jump Game V
Hard
1349
Maximum Students Taking Exam
Hard
1359
Count All Valid Pickup and Delivery Options
Hard
1363
Largest Multiple of Three
Hard
1372
Longest ZigZag Path in a Binary Tree
Medium
1373
Maximum Sum BST in Binary Tree
Hard
1387
Sort Integers by The Power Value
Medium
1388
Pizza With 3n Slices
Hard
1395
Count Number of Teams
Medium
1397
Find All Good Strings
Hard
1402
Reducing Dishes
Hard
1406
Stone Game III
Hard
1411
Number of Ways to Paint N × 3 Grid
Hard
1416
Restore The Array
Hard
1420
Build Array Where You Can Find The Maximum Exactly K Comparisons
Hard
1425
Constrained Subsequence Sum
Hard
1434
Number of Ways to Wear Different Hats to Each Other
Hard
1444
Number of Ways of Cutting a Pizza
Hard
1449
Form Largest Integer With Digits That Add up to Target
Hard
1458
Max Dot Product of Two Subsequences
Hard
1463
Cherry Pickup II
Hard
1467
Probability of a Two Boxes Having The Same Number of Distinct Balls
Hard
1473
Paint House III
Hard
1477
Find Two Non-overlapping Sub-arrays Each With Target Sum
Medium
1478
Allocate Mailboxes
Hard
1483
Kth Ancestor of a Tree Node
Hard
1493
Longest Subarray of 1's After Deleting One Element
Medium
1494
Parallel Courses II
Hard
1504
Count Submatrices With All Ones
Medium
1510
Stone Game IV
Hard
1524
Number of Sub-arrays With Odd Sum
Medium
1525
Number of Good Ways to Split a String
Medium
1526
Minimum Number of Increments on Subarrays to Form a Target Array
Hard
1531
String Compression II
Hard
1537
Get the Maximum Score
Hard
1547
Minimum Cost to Cut a Stick
Hard
1553
Minimum Number of Days to Eat N Oranges
Hard
1563
Stone Game V
Hard
1567
Maximum Length of Subarray With Positive Product
Medium
1569
Number of Ways to Reorder Array to Get Same BST
Hard
1575
Count All Possible Routes
Hard
1578
Minimum Time to Make Rope Colorful
Medium
1594
Maximum Non Negative Product in a Matrix
Medium
1595
Minimum Cost to Connect Two Groups of Points
Hard
1611
Minimum One Bit Operations to Make Integers Zero
Hard
1617
Count Subtrees With Max Distance Between Cities
Hard
1621
Number of Sets of K Non-Overlapping Line Segments
Medium
1626
Best Team With No Conflicts
Medium
1638
Count Substrings That Differ by One Character
Medium
1639
Number of Ways to Form a Target String Given a Dictionary
Hard
1641
Count Sorted Vowel Strings
Medium
1643
Kth Smallest Instructions
Hard
1653
Minimum Deletions to Make String Balanced
Medium
1654
Minimum Jumps to Reach Home
Medium
1655
Distribute Repeating Integers
Hard
1659
Maximize Grid Happiness
Hard
1668
Maximum Repeating Substring
Easy
1671
Minimum Number of Removals to Make Mountain Array
Hard
1681
Minimum Incompatibility
Hard
1687
Delivering Boxes from Storage to Ports
Hard
1690
Stone Game VII
Medium
1691
Maximum Height by Stacking Cuboids
Hard
1696
Jump Game VI
Medium
1723
Find Minimum Time to Finish All Jobs
Hard
1728
Cat and Mouse II
Hard
1735
Count Ways to Make Array With Product
Hard
1745
Palindrome Partitioning IV
Hard
1749
Maximum Absolute Sum of Any Subarray
Medium
1751
Maximum Number of Events That Can Be Attended II
Hard
1755
Closest Subsequence Sum
Hard
1770
Maximum Score from Performing Multiplication Operations
Hard
1771
Maximize Palindrome Length From Subsequences
Hard
1774
Closest Dessert Cost
Medium
1786
Number of Restricted Paths From First to Last Node
Medium
1787
Make the XOR of All Segments Equal to Zero
Hard
1799
Maximize Score After N Operations
Hard
1815
Maximum Number of Groups Getting Fresh Donuts
Hard
1824
Minimum Sideway Jumps
Medium
1857
Largest Color Value in a Directed Graph
Hard
1866
Number of Ways to Rearrange Sticks With K Sticks Visible
Hard
1871
Jump Game VII
Medium
1872
Stone Game VIII
Hard
1879
Minimum XOR Sum of Two Arrays
Hard
1883
Minimum Skips to Arrive at Meeting On Time
Hard
1884
Egg Drop With 2 Eggs and N Floors
Medium
1888
Minimum Number of Flips to Make the Binary String Alternating
Medium
1896
Minimum Cost to Change the Final Value of Expression
Hard
1900
The Earliest and Latest Rounds Where Players Compete
Hard
1911
Maximum Alternating Subsequence Sum
Medium
1916
Count Ways to Build Rooms in an Ant Colony
Hard
1928
Minimum Cost to Reach Destination in Time
Hard
1931
Painting a Grid With Three Different Colors
Hard
1937
Maximum Number of Points with Cost
Medium
1947
Maximum Compatibility Score Sum
Medium
1955
Count Number of Special Subsequences
Hard
1959
Minimum Total Space Wasted With K Resizing Operations
Medium
1976
Number of Ways to Arrive at Destination
Medium
1977
Number of Ways to Separate Numbers
Hard
1981
Minimize the Difference Between Target and Chosen Elements
Medium
1986
Minimum Number of Work Sessions to Finish the Tasks
Medium
1987
Number of Unique Good Subsequences
Hard
1994
The Number of Good Subsets
Hard
1997
First Day Where You Have Been in All the Rooms
Medium
2002
Maximum Product of the Length of Two Palindromic Subsequences
Medium
2003
Smallest Missing Genetic Value in Each Subtree
Hard
2008
Maximum Earnings From Taxi
Medium
2019
The Score of Students Solving Math Expression
Hard
2035
Partition Array Into Two Arrays to Minimize Sum Difference
Hard
2050
Parallel Courses III
Hard
2054
Two Best Non-Overlapping Events
Medium
2060
Check if an Original String Exists Given Two Encoded Strings
Hard
2063
Vowels of All Substrings
Medium
2086
Minimum Number of Food Buckets to Feed the Hamsters
Medium
2088
Count Fertile Pyramids in a Land
Hard
2100
Find Good Days to Rob the Bank
Medium
2110
Number of Smooth Descent Periods of a Stock
Medium
2140
Solving Questions With Brainpower
Medium
2147
Number of Ways to Divide a Long Corridor
Hard
2163
Minimum Difference in Sums After Removal of Elements
Hard
2167
Minimum Time to Remove All Cars Containing Illegal Goods
Hard
2172
Maximum AND Sum of Array
Hard
2188
Minimum Time to Finish the Race
Hard
2209
Minimum White Tiles After Covering With Carpets
Hard
2218
Maximum Value of K Coins From Piles
Hard
2222
Number of Ways to Select Buildings
Medium
2262
Total Appeal of A String
Hard
2266
Count Number of Texts
Medium
2267
Check if There Is a Valid Parentheses String Path
Hard
2272
Substring With Largest Variance
Hard
2304
Minimum Path Cost in a Grid
Medium
2305
Fair Distribution of Cookies
Medium
2310
Sum of Numbers With Units Digit K
Medium
2311
Longest Binary Subsequence Less Than or Equal to K
Medium
2312
Selling Pieces of Wood
Hard
2318
Number of Distinct Roll Sequences
Hard
2320
Count Number of Ways to Place Houses
Medium
2321
Maximum Score Of Spliced Array
Hard
2327
Number of People Aware of a Secret
Medium
2328
Number of Increasing Paths in a Grid
Hard
2338
Count the Number of Ideal Arrays
Hard
2369
Check if There is a Valid Partition For The Array
Medium
2370
Longest Ideal Subsequence
Medium
2376
Count Special Integers
Hard
2380
Time Needed to Rearrange a Binary String
Medium
2400
Number of Ways to Reach a Position After Exactly k Steps
Medium
2407
Longest Increasing Subsequence II
Hard
2420
Find All Good Indices
Medium
2430
Maximum Deletions on a String
Hard
2435
Paths in Matrix Whose Sum Is Divisible by K
Hard
2439
Minimize Maximum of Array
Medium
2463
Minimum Total Distance Traveled
Hard
2466
Count Ways To Build Good Strings
Medium
2472
Maximum Number of Non-overlapping Palindrome Substrings
Hard
2478
Number of Beautiful Partitions
Hard
2484
Count Palindromic Subsequences
Hard
2501
Longest Square Streak in an Array
Medium
2518
Number of Great Partitions
Hard
2522
Partition String Into Substrings With Values at Most K
Medium
2538
Difference Between Maximum and Minimum Price Sum
Hard
2547
Minimum Cost to Split an Array
Hard
2552
Count Increasing Quadruplets
Hard
2556
Disconnect Path in a Binary Matrix by at Most One Flip
Medium
2560
House Robber IV
Medium
2571
Minimum Operations to Reduce an Integer to 0
Medium
2572
Count the Number of Square-Free Subsets
Medium
2573
Find the String with LCP
Hard
2581
Count Number of Possible Root Nodes
Hard
2585
Number of Ways to Earn Points
Hard
2597
The Number of Beautiful Subsets
Medium
2606
Find the Substring With Maximum Cost
Medium
2616
Minimize the Maximum Difference of Pairs
Medium
2617
Minimum Number of Visited Cells in a Grid
Hard
2645
Minimum Additions to Make Valid String
Medium
2646
Minimize the Total Price of the Trips
Hard
2673
Make Costs of Paths Equal in a Binary Tree
Medium
2681
Power of Heroes
Hard
2684
Maximum Number of Moves in a Grid
Medium
2707
Extra Characters in a String
Medium
2708
Maximum Strength of a Group
Medium
2712
Minimum Cost to Make All Characters Equal
Medium
2713
Maximum Strictly Increasing Cells in a Matrix
Hard
2719
Count of Integers
Hard
2741
Special Permutations
Medium
2742
Painting the Walls
Hard
2745
Construct the Longest New String
Medium
2746
Decremental String Concatenation
Medium
2750
Ways to Split Array Into Good Subarrays
Medium
2767
Partition String Into Minimum Beautiful Substrings
Medium
2770
Maximum Number of Jumps to Reach the Last Index
Medium
2771
Longest Non-decreasing Subarray From Two Arrays
Medium
2786
Visit Array Positions to Maximize Score
Medium
2787
Ways to Express an Integer as Sum of Powers
Medium
2791
Count Paths That Can Form a Palindrome in a Tree
Hard
2801
Count Stepping Numbers in Range
Hard
2809
Minimum Time to Make Array Sum At Most x
Hard
2811
Check if it is Possible to Split Array
Medium
2826
Sorting Three Groups
Medium
2827
Number of Beautiful Integers in the Range
Hard
2830
Maximize the Profit as the Salesman
Medium
2836
Maximize Value of Function in a Ball Passing Game
Hard
2850
Minimum Moves to Spread Stones Over Grid
Medium
2851
String Transformation
Hard
2858
Minimum Edge Reversals So Every Node Is Reachable
Hard
2867
Count Valid Paths in a Tree
Hard
2876
Count Visited Nodes in a Directed Graph
Hard
2896
Apply Operations to Make Two Strings Equal
Medium
2900
Longest Unequal Adjacent Groups Subsequence I
Easy
2901
Longest Unequal Adjacent Groups Subsequence II
Medium
2902
Count of Sub-Multisets With Bounded Sum
Hard
2911
Minimum Changes to Make K Semi-palindromes
Hard
2915
Length of the Longest Subsequence That Sums to Target
Medium
2916
Subarrays Distinct Element Sum of Squares II
Hard
2919
Minimum Increment Operations to Make Array Beautiful
Medium
2920
Maximum Points After Collecting Coins From All Nodes
Hard
2925
Maximum Score After Applying Operations on a Tree
Medium
2926
Maximum Balanced Subsequence Sum
Hard
2930
Number of Strings Which Can Be Rearranged to Contain Substring
Medium
2944
Minimum Number of Coins for Fruits
Medium
2945
Find Maximum Non-decreasing Array Length
Hard
2957
Remove Adjacent Almost-Equal Characters
Medium
2973
Find Number of Coins to Place in Tree Nodes
Hard
2977
Minimum Cost to Convert String II
Hard
2998
Minimum Number of Operations to Make X and Y Equal
Medium
2999
Count the Number of Powerful Integers
Hard
3003
Maximize the Number of Partitions After Operations
Hard
3007
Maximum Number That Sum of the Prices Is Less Than or Equal to K
Medium
3040
Maximum Number of Operations With the Same Score II
Medium
3041
Maximize Consecutive Elements in an Array After Modification
Hard
3068
Find the Maximum Sum of Node Values
Hard
3077
Maximum Strength of K Disjoint Subarrays
Hard
3082
Find the Sum of the Power of All Subsequences
Hard
3098
Find the Sum of Subsequence Powers
Hard
3117
Minimum Sum of Values by Dividing Array
Hard
3122
Minimum Number of Operations to Satisfy Conditions
Medium
3129
Find All Possible Stable Binary Arrays I
Medium
3130
Find All Possible Stable Binary Arrays II
Hard
3144
Minimum Substring Partition of Equal Character Frequency
Medium
3148
Maximum Difference Score in a Grid
Medium
3149
Find the Minimum Cost Array Permutation
Hard
3154
Find Number of Ways to Reach the K-th Stair
Hard
3165
Maximum Sum of Subsequence With Non-adjacent Elements
Hard
3176
Find the Maximum Length of a Good Subsequence I
Medium
3177
Find the Maximum Length of a Good Subsequence II
Hard
3180
Maximum Total Reward Using Operations I
Medium
3181
Maximum Total Reward Using Operations II
Hard
3186
Maximum Total Damage With Spell Casting
Medium
3192
Minimum Operations to Make Binary Array Elements Equal to One II
Medium
3193
Count the Number of Inversions
Hard
3196
Maximize Total Cost of Alternating Subarrays
Medium
3201
Find the Maximum Length of Valid Subsequence I
Medium
3202
Find the Maximum Length of Valid Subsequence II
Medium
3213
Construct String with Minimum Cost
Hard
3218
Minimum Cost for Cutting Cake I
Medium
3225
Maximum Score From Grid Operations
Hard
3229
Minimum Operations to Make Array Equal to Target
Hard
3241
Time Taken to Mark All Nodes
Hard
3250
Find the Count of Monotonic Pairs I
Hard
3251
Find the Count of Monotonic Pairs II
Hard
3256
Maximum Value Sum by Placing Three Rooks I
Hard
3257
Maximum Value Sum by Placing Three Rooks II
Hard
3259
Maximum Energy Boost From Two Drinks
Medium
3260
Find the Largest Palindrome Divisible by K
Hard
3276
Select Cells in Grid With Maximum Score
Hard
3277
Maximum XOR Score Subarray Queries
Hard
3287
Find the Maximum Sequence Value of Array
Hard
3290
Maximum Multiplication Score
Medium
3291
Minimum Number of Valid Strings to Form Target I
Medium
3292
Minimum Number of Valid Strings to Form Target II
Hard
3302
Find the Lexicographically Smallest Valid Sequence
Medium
3316
Find Maximum Removals From Source String
Medium
3317
Find the Number of Possible Ways for an Event
Hard
3320
Count The Number of Winning Sequences
Hard
3332
Maximum Points Tourist Can Earn
Medium
3333
Find the Original Typed String II
Hard
3335
Total Characters in String After Transformations I
Medium
3336
Find the Number of Subsequences With Equal GCD
Hard
3337
Total Characters in String After Transformations II
Hard
3343
Count Number of Balanced Permutations
Hard
3351
Sum of Good Subsequences
Hard
3352
Count K-Reducible Numbers Less Than N
Hard
3363
Find the Maximum Number of Fruits Collected
Hard
3366
Minimum Array Sum
Medium
3367
Maximize Sum of Weights after Edge Removals
Hard
3376
Minimum Time to Break Locks I
Medium
3388
Count Beautiful Splits in an Array
Medium
3389
Minimum Operations to Make Character Frequencies Equal
Hard
3393
Count Paths With the Given XOR Value
Medium
3409
Longest Subsequence With Decreasing Adjacent Difference
Medium
3410
Maximize Subarray Sum After Removing All Occurrences of One Element
Hard
3414
Maximum Score of Non-overlapping Intervals
Hard
3418
Maximum Amount of Money Robot Can Earn
Medium
3428
Maximum and Minimum Sums of at Most Size K Subsequences
Medium
3429
Paint House IV
Medium
3434
Maximum Frequency After Subarray Operation
Medium
3441
Minimum Cost Good Caption
Hard
3444
Minimum Increments for Target Multiples in an Array
Hard
3448
Count Substrings Divisible By Last Digit
Hard
3458
Select K Disjoint Special Substrings
Medium
3459
Length of Longest V-Shaped Diagonal Segment
Hard
3469
Find Minimum Cost to Remove Array Elements
Medium
3472
Longest Palindromic Subsequence After at Most K Operations
Medium
3473
Sum of K Subarrays With Length at Least M
Medium
3489
Zero Array Transformation IV
Medium
3490
Count Beautiful Numbers
Hard
3500
Minimum Cost to Divide Array Into Subarrays
Hard
3503
Longest Palindrome After Substring Concatenation I
Medium
3504
Longest Palindrome After Substring Concatenation II
Hard
3505
Minimum Operations to Make Elements Within K Subarrays Equal
Hard
3509
Maximum Product of Subsequences With an Alternating Sum Equal to K
Hard
3519
Count Numbers with Non-Decreasing Digits
Hard
3524
Find X Value of Array I
Medium
3530
Maximum Profit from Valid Topological Order in DAG
Hard
3533
Concatenated Divisibility
Hard
3538
Merge Operations for Minimum Travel Time
Hard
3539
Find Sum of Array Product of Magical Sequences
Hard
3543
Maximum Weighted K-Edge Path
Medium
3544
Subtree Inversion Sum
Hard
3557
Find Maximum Number of Non Intersecting Substrings
Medium
3559
Number of Ways to Assign Edge Weights II
Hard
3562
Maximum Profit from Trading Stocks with Discounts
Hard
3563
Lexicographically Smallest String After Adjacent Removals
Hard
3573
Best Time to Buy and Sell Stock V
Medium
3575
Maximum Good Subtree Score
Hard
3578
Count Partitions With Max-Min Difference at Most K
Medium
3579
Minimum Steps to Convert String with Operations
Hard
3585
Find Weighted Median Node in Tree
Hard
3592
Inverse Coin Change
Medium
3593
Minimum Increments to Equalize Leaf Paths
Medium
3594
Minimum Time to Transport All Individuals
Hard
3599
Partition Array to Minimize XOR
Medium
3603
Minimum Cost Path with Alternating Directions II
Medium
3615
Longest Palindromic Path in Graph
Hard
3620
Network Recovery Pathways
Hard
3621
Number of Integers With Popcount-Depth Equal to K I
Hard
← Browse all LeetCode problems