Problems with tag Dynamic Programming

550 found, showing 150 to 180

Find the Substring With Maximum Cost ->

Medium, #2606, 2 solutions

Find the Sum of Subsequence Powers ->

Hard, #3098, 2 solutions

Find the Sum of the Power of All Subsequences ->

Hard, #3082, 2 solutions

Find Two Non-overlapping Sub-arrays Each With Target Sum ->

Medium, #1477, 2 solutions

First Day Where You Have Been in All the Rooms ->

Medium, #1997, 2 solutions

Flip Game II ->

Medium, #294, 2 solutions

Flip String to Monotone Increasing ->

Medium, #926, 2 solutions

Form Largest Integer With Digits That Add up to Target ->

Hard, #1449, 2 solutions

Freedom Trail ->

Hard, #514, 3 solutions

Frog Jump ->

Hard, #403, 3 solutions

Game of Nim ->

Medium, #1908, 2 solutions

Generate Parentheses ->

Medium, #22, 5 solutions

Get the Maximum Score ->

Hard, #1537, 2 solutions

Greatest Sum Divisible by Three ->

Medium, #1262, 2 solutions

Guess Number Higher or Lower II ->

Medium, #375, 2 solutions

->

Hard,

House Robber II ->

Medium, #213, 5 solutions

House Robber III ->

Medium, #337, 5 solutions

House Robber ->

Medium, #198, 6 solutions

Integer Break ->

Medium, #343, 3 solutions

Integer Replacement ->

Medium, #397, 3 solutions

Interleaving String ->

Medium, #97, 4 solutions

Is Subsequence ->

Easy, #392, 3 solutions

Jump Game II ->

Medium, #45, 4 solutions

Jump Game IX ->

Medium, #2297, 2 solutions

Jump Game V ->

Hard, #1340, 3 solutions

Jump Game VI ->

Medium, #1696, 2 solutions

Jump Game VII ->

Medium, #1871, 3 solutions

->

Medium,

Jump Game ->

Medium, #55, 6 solutions

1
...
5
6
7
...
19
;