Dashboard Questions Topics Companies Sheets

Dynamic Programming

Topic

546 coding problems covering Dynamic Programming concepts. Master this topic and improve your problem-solving skills.

546

Problems

Easy

269

Medium

264

Hard

Difficulty

All546 Easy13 Medium269 Hard264

Title	Solve	Difficulty	Companies	Topics
3176. Find the Maximum Length of a Good Subsequence I	Solve	Medium	-	Array Dynamic Programming+1
3177. Find the Maximum Length of a Good Subsequence II	Solve	Hard	-	Array Dynamic Programming+1
3180. Maximum Total Reward Using Operations I	Solve	Medium	-	Array Dynamic Programming
3181. Maximum Total Reward Using Operations II	Solve	Hard	-	Array Bit Manipulation+1
3183. The Number of Ways to Make the Sum	Solve	Medium	-	Array Dynamic Programming
3186. Maximum Total Damage With Spell Casting	Solve	Medium	-	Array Binary Search+5
3192. Minimum Operations to Make Binary Array Elements Equal to One II	Solve	Medium	-	Array Dynamic Programming+1
3193. Count the Number of Inversions	Solve	Hard	-	Array Dynamic Programming
3196. Maximize Total Cost of Alternating Subarrays	Solve	Medium	-	Array Dynamic Programming
3201. Find the Maximum Length of Valid Subsequence I	Solve	Medium	-	Array Dynamic Programming
3202. Find the Maximum Length of Valid Subsequence II	Solve	Medium	-	Array Dynamic Programming
3205. Maximum Array Hopping Score I	Solve	Medium	-	Array Dynamic Programming+3
3213. Construct String with Minimum Cost	Solve	Hard	-	Array Dynamic Programming+2
3218. Minimum Cost for Cutting Cake I	Solve	Medium	-	Array Dynamic Programming+2
3225. Maximum Score From Grid Operations	Solve	Hard	-	Array Dynamic Programming+2
3229. Minimum Operations to Make Array Equal to Target	Solve	Hard	-	Array Dynamic Programming+3
3241. Time Taken to Mark All Nodes	Solve	Hard	-	Depth-First Search Dynamic Programming+2
3247. Number of Subsequences with Odd Sum	Solve	Medium	-	Array Combinatorics+2
3250. Find the Count of Monotonic Pairs I	Solve	Hard	-	Array Combinatorics+3
3251. Find the Count of Monotonic Pairs II	Solve	Hard	-	Array Combinatorics+3
3256. Maximum Value Sum by Placing Three Rooks I	Solve	Hard	-	Array Dynamic Programming+2
3257. Maximum Value Sum by Placing Three Rooks II	Solve	Hard	-	Array Dynamic Programming+2
3259. Maximum Energy Boost From Two Drinks	Solve	Medium	-	Array Dynamic Programming
3260. Find the Largest Palindrome Divisible by K	Solve	Hard	-	Dynamic Programming Greedy+3
3269. Constructing Two Increasing Arrays	Solve	Hard	-	Array Dynamic Programming
3276. Select Cells in Grid With Maximum Score	Solve	Hard	-	Array Bit Manipulation+3
3277. Maximum XOR Score Subarray Queries	Solve	Hard	-	Array Dynamic Programming
3284. Sum of Consecutive Subarrays	Solve	Medium	-	Array Dynamic Programming+1
3287. Find the Maximum Sequence Value of Array	Solve	Hard	-	Array Bit Manipulation+1
3290. Maximum Multiplication Score	Solve	Medium	-	Array Dynamic Programming
3291. Minimum Number of Valid Strings to Form Target I	Solve	Medium	-	Array Binary Search+7
3292. Minimum Number of Valid Strings to Form Target II	Solve	Hard	-	Array Binary Search+6
3299. Sum of Consecutive Subsequences	Solve	Hard	-	Array Dynamic Programming+1
3302. Find the Lexicographically Smallest Valid Sequence	Solve	Medium	-	Dynamic Programming Greedy+2
3316. Find Maximum Removals From Source String	Solve	Medium	-	Array Dynamic Programming+3
3317. Find the Number of Possible Ways for an Event	Solve	Hard	-	Combinatorics Dynamic Programming+1
3320. Count The Number of Winning Sequences	Solve	Hard	-	Dynamic Programming String
3332. Maximum Points Tourist Can Earn	Solve	Medium	-	Array Dynamic Programming+1
3333. Find the Original Typed String II	Solve	Hard	-	Dynamic Programming Prefix Sum+1
3335. Total Characters in String After Transformations I	Solve	Medium	-	Counting Dynamic Programming+3
3336. Find the Number of Subsequences With Equal GCD	Solve	Hard	-	Array Dynamic Programming+2
3337. Total Characters in String After Transformations II	Solve	Hard	-	Counting Dynamic Programming+3
3339. Find the Number of K-Even Arrays	Solve	Medium	-	Dynamic Programming
3343. Count Number of Balanced Permutations	Solve	Hard	-	Combinatorics Dynamic Programming+2
3351. Sum of Good Subsequences	Solve	Hard	-	Array Dynamic Programming+1
3352. Count K-Reducible Numbers Less Than N	Solve	Hard	-	Combinatorics Dynamic Programming+2