Problems
Topics
Tags
Progress
Search
Open user menu
Open main menu
Home
|
Tag
|
DP
Problems with tag
DP
173 found, showing 60 to 90
1
2
3
4
5
6
;
Longest Ideal Subsequence
->
Medium,
#2370,
2 solutions
Largest Rectangle in Histogram
->
Hard,
#84,
5 solutions
Longest Increasing Subsequence
->
Medium,
#300,
5 solutions
Largest Color Value in a Directed Graph
->
Hard,
#1857,
3 solutions
Longest Non-decreasing Subarray From Two Arrays
->
Medium,
#2771,
2 solutions
Longest Square Streak in an Array
->
Medium,
#2501,
2 solutions
Make Array Non-decreasing or Non-increasing
->
Hard,
#2263,
2 solutions
Maximize the Profit as the Salesman
->
Medium,
#2830,
2 solutions
Maximize Consecutive Elements in an Array After Modification
->
Hard,
#3041,
2 solutions
Maximize Total Cost of Alternating Subarrays
->
Medium,
#3196,
2 solutions
Maximize Total Tastiness of Purchased Fruits
->
Medium,
#2431,
2 solutions
Longest Unequal Adjacent Groups Subsequence II
->
Medium,
#2901,
2 solutions
Maximum Cost of Trip With K Highways
->
Hard,
#2247,
2 solutions
Maximum AND Sum of Array
->
Hard,
#2172,
2 solutions
Maximize Win From Two Segments
->
Medium,
#2555,
2 solutions
Maximum Deletions on a String
->
Hard,
#2430,
2 solutions
Maximum Compatibility Score Sum
->
Medium,
#1947,
2 solutions
Maximum Hamming Distances
->
Hard,
#3141,
2 solutions
Maximum Difference Score in a Grid
->
Medium,
#3148,
2 solutions
Maximum Earnings From Taxi
->
Medium,
#2008,
2 solutions
Maximum GCD-Sum of a Subarray
->
Hard,
#2941,
2 solutions
Maximum Length of a Concatenated String with Unique Characters
->
Medium,
#1239,
2 solutions
Maximum Number of Moves in a Grid
->
Medium,
#2684,
2 solutions
Maximum Length of Repeated Subarray
->
Medium,
#718,
2 solutions
Maximum Product of the Length of Two Palindromic Subsequences
->
Medium,
#2002,
2 solutions
Maximum Number of Groups Getting Fresh Donuts
->
Hard,
#1815,
3 solutions
Maximum Profit From Trading Stocks
->
Medium,
#2291,
2 solutions
Maximum Number of Jumps to Reach the Last Index
->
Medium,
#2770,
2 solutions
Maximum Number of Removal Queries That Can Be Processed I
->
Hard,
#3018,
2 solutions
Maximum Product of the Length of Two Palindromic Substrings
->
Hard,
#1960,
2 solutions