Dynamic Programming

15 questions

1Minimum Operations to Reduce an Integer to 0Medium

Dynamic ProgrammingGreedyBit Manipulation

2Minimum Edge Reversals So Every Node Is ReachableHard

Dynamic ProgrammingDepth-First SearchBreadth-First Search

3Minimum Operations to Reduce an Integer to 0Medium

Dynamic ProgrammingGreedyBit Manipulation

4Minimum Edge Reversals So Every Node Is ReachableHard

Dynamic ProgrammingDepth-First SearchBreadth-First Search

5Minimum Operations to Reduce an Integer to 0Medium

Dynamic ProgrammingGreedyBit Manipulation

6Binary Tree Maximum Path SumHard

Dynamic ProgrammingTreeDepth-First Search

7All Possible Full Binary TreesMedium

Dynamic ProgrammingTreeRecursion

8Maximize Grid HappinessHard

Dynamic ProgrammingBit ManipulationMemoization

9House Robber IIIMedium

Dynamic ProgrammingTreeDepth-First Search

10Minimum Operations to Reduce an Integer to 0Medium

Dynamic ProgrammingGreedyBit Manipulation

11Maximize Grid HappinessHard

Dynamic ProgrammingBit ManipulationMemoization

12Binary Tree Maximum Path SumHard

Dynamic ProgrammingTreeDepth-First Search

13All Possible Full Binary TreesMedium

Dynamic ProgrammingTreeRecursion

14House Robber IIIMedium

Dynamic ProgrammingTreeDepth-First Search

15Minimum Edge Reversals So Every Node Is ReachableHard

Dynamic ProgrammingDepth-First SearchBreadth-First Search