Problems Topics Tags Progress

Search

Home

|

Tag

|

Dynamic Programming

Problems with tag Dynamic Programming

550 found, showing 330 to 360

...

12

...

;

Minimum Edge Reversals So Every Node Is Reachable ->

Hard, #2858, 2 solutions

Minimum Flips in Binary Tree to Get Result ->

Hard, #2313, 2 solutions

Minimum Falling Path Sum II ->

Hard, #1289, 2 solutions

Minimum Falling Path Sum ->

Medium, #931, 3 solutions

Minimum Incompatibility ->

Hard, #1681, 2 solutions

Minimum Moves to Spread Stones Over Grid ->

Medium, #2850, 2 solutions

Minimum Increment Operations to Make Array Beautiful ->

Medium, #2919, 2 solutions

Minimum Jumps to Reach Home ->

Medium, #1654, 2 solutions

Minimum Number of Days to Eat N Oranges ->

Hard, #1553, 2 solutions

Minimum Insertion Steps to Make a String Palindrome ->

Hard, #1312, 2 solutions

Minimum Number of Coins for Fruits II ->

Hard, #2969, 2 solutions

->

Medium,

Minimum Number of Flips to Make the Binary String Alternatings ->

Medium, #1888, 2 solutions

Minimum Number of Operations to Make X and Y Equal ->

Medium, #2998, 2 solutions

Minimum Number of Coins for Fruits ->

Medium, #2944, 2 solutions

Minimum Number of Refueling Stops ->

Hard, #871, 3 solutions

Minimum Number of Removals to Make Mountain Array ->

Hard, #1671, 2 solutions

Minimum Number of Increments on Subarrays to Form a Target Array ->

Hard, #1526, 2 solutions

Minimum Number of Lines to Cover Points ->

Medium, #2152, 2 solutions

Minimum Number of Operations to Satisfy Conditions ->

Medium, #3122, 2 solutions

Minimum Number of Taps to Open to Water a Garden ->

Hard, #1326, 3 solutions

Minimum Number of Visited Cells in a Grid ->

Hard, #2617, 2 solutions

Minimum Number of Work Sessions to Finish the Tasks ->

Medium, #1986, 2 solutions

Minimum Operations to Reduce an Integer to 0 ->

Medium, #2571, 2 solutions

Minimum Score Triangulation of Polygon ->

Medium, #1039, 2 solutions

Minimum One Bit Operations to Make Integers Zero ->

Hard, #1611, 2 solutions

Minimum Path Cost in a Grid ->

Medium, #2304, 2 solutions

Minimum Path Sum ->

Medium, #64, 4 solutions

Minimum Skips to Arrive at Meeting On Time ->

Hard, #1883, 2 solutions

Minimum Sideway Jumps ->

Medium, #1824, 3 solutions