1Binary Tree Maximum Path SumHardDynamic ProgrammingTreeDepth-First Search
Solve → 2Sort Integers by The Power ValueMediumDynamic ProgrammingMemoizationSorting
Solve → 3Sort Integers by The Power ValueMediumDynamic ProgrammingMemoizationSorting
Solve → 4Champagne TowerMediumDynamic Programming
Solve → 5Binary Tree Maximum Path SumHardDynamic ProgrammingTreeDepth-First Search
Solve → 6Cheapest Flights Within K StopsMediumDynamic ProgrammingDepth-First SearchBreadth-First Search
Solve → 7Sort Integers by The Power ValueMediumDynamic ProgrammingMemoizationSorting
Solve → 8Binary Tree Maximum Path SumHardDynamic ProgrammingTreeDepth-First Search
Solve → 9Ways to Express an Integer as Sum of PowersMediumDynamic Programming
Solve → 10Counting BitsEasyDynamic ProgrammingBit Manipulation
Solve → 11Cheapest Flights Within K StopsMediumDynamic ProgrammingDepth-First SearchBreadth-First Search
Solve → 12Number of Ways to Arrive at DestinationMediumDynamic ProgrammingGraph TheoryTopological Sort
Solve → 13Binary Tree CamerasHardDynamic ProgrammingTreeDepth-First Search
Solve → 14Number of People Aware of a SecretMediumDynamic ProgrammingQueueSimulation
Solve → 15Knight DialerMediumDynamic Programming
Solve → 16Painting a Grid With Three Different ColorsHardDynamic Programming
Solve → 17Unique Binary Search Trees IIMediumDynamic ProgrammingBacktrackingTree
Solve → 18Domino and Tromino TilingMediumDynamic Programming
Solve → 19Number of Ways to Paint N × 3 GridHardDynamic Programming
Solve → 20Out of Boundary PathsMediumDynamic Programming
Solve → 21Student Attendance Record IIHardDynamic Programming
Solve → 22The Earliest and Latest Rounds Where Players CompeteHardDynamic ProgrammingMemoization
Solve → 23Non-negative Integers without Consecutive OnesHardDynamic Programming
Solve → 24House Robber IIIMediumDynamic ProgrammingTreeDepth-First Search
Solve → 25Minimum Operations to Reduce an Integer to 0MediumDynamic ProgrammingGreedyBit Manipulation
Solve → 26Maximum Sum BST in Binary TreeHardDynamic ProgrammingTreeDepth-First Search
Solve → 27Number of ZigZag Arrays IHardDynamic ProgrammingPrefix Sum
Solve → 28Sort Integers by The Power ValueMediumDynamic ProgrammingMemoizationSorting
Solve → 29Binary Tree Maximum Path SumHardDynamic ProgrammingTreeDepth-First Search
Solve → 30Cheapest Flights Within K StopsMediumDynamic ProgrammingDepth-First SearchBreadth-First Search
Solve → 31Counting BitsEasyDynamic ProgrammingBit Manipulation
Solve → 32Ways to Express an Integer as Sum of PowersMediumDynamic Programming
Solve → 33Number of Ways to Arrive at DestinationMediumDynamic ProgrammingGraph TheoryTopological Sort
Solve → 34Binary Tree CamerasHardDynamic ProgrammingTreeDepth-First Search
Solve → 35Number of People Aware of a SecretMediumDynamic ProgrammingQueueSimulation
Solve → 36Number of Ways to Paint N × 3 GridHardDynamic Programming
Solve → 37Unique Binary Search Trees IIMediumDynamic ProgrammingBacktrackingTree
Solve → 38Knight DialerMediumDynamic Programming
Solve → 39Domino and Tromino TilingMediumDynamic Programming
Solve → 40Painting a Grid With Three Different ColorsHardDynamic Programming
Solve → 41House Robber IIIMediumDynamic ProgrammingTreeDepth-First Search
Solve → 42Champagne TowerMediumDynamic Programming
Solve → 43Out of Boundary PathsMediumDynamic Programming
Solve → 44Maximum Sum BST in Binary TreeHardDynamic ProgrammingTreeDepth-First Search
Solve → 45The Earliest and Latest Rounds Where Players CompeteHardDynamic ProgrammingMemoization
Solve → 46Non-negative Integers without Consecutive OnesHardDynamic Programming
Solve → 47Student Attendance Record IIHardDynamic Programming
Solve → 48Minimum Operations to Reduce an Integer to 0MediumDynamic ProgrammingGreedyBit Manipulation
Solve → 49Number of ZigZag Arrays IHardDynamic ProgrammingPrefix Sum
Solve →