1Number of ZigZag Arrays IHardDynamic ProgrammingPrefix Sum
Solve → 2Binary Tree Maximum Path SumHardDynamic ProgrammingTreeDepth-First Search
Solve → 3Number of ZigZag Arrays IHardDynamic ProgrammingPrefix Sum
Solve → 4Cheapest Flights Within K StopsMediumDynamic ProgrammingDepth-First SearchBreadth-First Search
Solve → 5Sum of Distances in TreeHardDynamic ProgrammingTreeDepth-First Search
Solve → 6Binary Tree Maximum Path SumHardDynamic ProgrammingTreeDepth-First Search
Solve → 7Unique Binary Search Trees IIMediumDynamic ProgrammingBacktrackingTree
Solve → 8Champagne TowerMediumDynamic Programming
Solve → 9Binary Tree Maximum Path SumHardDynamic ProgrammingTreeDepth-First Search
Solve → 10Cheapest Flights Within K StopsMediumDynamic ProgrammingDepth-First SearchBreadth-First Search
Solve → 11Number of ZigZag Arrays IHardDynamic ProgrammingPrefix Sum
Solve → 12Unique Binary Search Trees IIMediumDynamic ProgrammingBacktrackingTree
Solve → 13House Robber IIIMediumDynamic ProgrammingTreeDepth-First Search
Solve → 14Find All Possible Stable Binary Arrays IMediumDynamic ProgrammingPrefix Sum
Solve → 15Sum of Distances in TreeHardDynamic ProgrammingTreeDepth-First Search
Solve → 16Maximum Sum BST in Binary TreeHardDynamic ProgrammingTreeDepth-First Search
Solve → 17Number of Ways to Arrive at DestinationMediumDynamic ProgrammingGraph TheoryTopological Sort
Solve → 18Race CarHardDynamic Programming
Solve → 19Shortest Path Visiting All NodesHardDynamic ProgrammingBit ManipulationBreadth-First Search
Solve → 20Binary Tree Maximum Path SumHardDynamic ProgrammingTreeDepth-First Search
Solve → 21Cheapest Flights Within K StopsMediumDynamic ProgrammingDepth-First SearchBreadth-First Search
Solve → 22Race CarHardDynamic Programming
Solve → 23Domino and Tromino TilingMediumDynamic Programming
Solve → 24House Robber IIIMediumDynamic ProgrammingTreeDepth-First Search
Solve → 25Android Unlock PatternsMediumDynamic ProgrammingBacktrackingBit Manipulation
Solve → 26Counting BitsEasyDynamic ProgrammingBit Manipulation
Solve → 27Shortest Path Visiting All NodesHardDynamic ProgrammingBit ManipulationBreadth-First Search
Solve → 28Sum of Distances in TreeHardDynamic ProgrammingTreeDepth-First Search
Solve → 29Student Attendance Record IIHardDynamic Programming
Solve → 30Painting a Grid With Three Different ColorsHardDynamic Programming
Solve → 31Find the City With the Smallest Number of Neighbors at a Threshold DistanceMediumDynamic ProgrammingGraph TheoryShortest Path
Solve → 32Number of Ways to Arrive at DestinationMediumDynamic ProgrammingGraph TheoryTopological Sort
Solve → 33Unique Binary Search Trees IIMediumDynamic ProgrammingBacktrackingTree
Solve → 34Parallel Courses IIHardDynamic ProgrammingBit ManipulationGraph Theory
Solve → 35Ways to Express an Integer as Sum of PowersMediumDynamic Programming
Solve → 36Number of People Aware of a SecretMediumDynamic ProgrammingQueueSimulation
Solve → 37Champagne TowerMediumDynamic Programming
Solve → 38The Earliest and Latest Rounds Where Players CompeteHardDynamic ProgrammingMemoization
Solve → 39Maximum Sum BST in Binary TreeHardDynamic ProgrammingTreeDepth-First Search
Solve → 40Integer ReplacementMediumDynamic ProgrammingGreedyBit Manipulation
Solve → 41Knight DialerMediumDynamic Programming
Solve → 42Sort Integers by The Power ValueMediumDynamic ProgrammingMemoizationSorting
Solve → 43Number of Dice Rolls With Target SumMediumDynamic Programming
Solve → 44All Possible Full Binary TreesMediumDynamic ProgrammingTreeRecursion
Solve → 45Knight Probability in ChessboardMediumDynamic Programming
Solve → 46Binary Tree CamerasHardDynamic ProgrammingTreeDepth-First Search
Solve → 47K Inverse Pairs ArrayHardDynamic Programming
Solve → 48Build Array Where You Can Find The Maximum Exactly K ComparisonsHardDynamic ProgrammingPrefix Sum
Solve → 49Paint FenceMediumDynamic Programming
Solve → 50Minimum Number of Days to Eat N OrangesHardDynamic ProgrammingMemoization
Solve → 51Number of Restricted Paths From First to Last NodeMediumDynamic ProgrammingGraph TheoryTopological Sort
Solve → 52Number of Ways to Paint N × 3 GridHardDynamic Programming
Solve → 53Number of Ways to Stay in the Same Place After Some StepsHardDynamic Programming
Solve → 54Find All Possible Stable Binary Arrays IMediumDynamic ProgrammingPrefix Sum
Solve → 55Minimum Flips in Binary Tree to Get ResultHardDynamic ProgrammingTreeDepth-First Search
Solve → 56Maximum Score After Applying Operations on a TreeMediumDynamic ProgrammingTreeDepth-First Search
Solve → 57Count Ways to Distribute CandiesHardDynamic Programming
Solve → 58Count Ways To Build Good StringsMediumDynamic Programming
Solve → 59Non-negative Integers without Consecutive OnesHardDynamic Programming
Solve → 60Minimum Operations to Reduce an Integer to 0MediumDynamic ProgrammingGreedyBit Manipulation
Solve → 61Count Number of Ways to Place HousesMediumDynamic Programming
Solve → 62Binary Tree Maximum Path SumHardDynamic ProgrammingTreeDepth-First Search
Solve → 63Race CarHardDynamic Programming
Solve → 64Cheapest Flights Within K StopsMediumDynamic ProgrammingDepth-First SearchBreadth-First Search
Solve → 65Domino and Tromino TilingMediumDynamic Programming
Solve → 66Android Unlock PatternsMediumDynamic ProgrammingBacktrackingBit Manipulation
Solve → 67Champagne TowerMediumDynamic Programming
Solve → 68Sum of Distances in TreeHardDynamic ProgrammingTreeDepth-First Search
Solve → 69Shortest Path Visiting All NodesHardDynamic ProgrammingBit ManipulationBreadth-First Search
Solve → 70House Robber IIIMediumDynamic ProgrammingTreeDepth-First Search
Solve → 71Student Attendance Record IIHardDynamic Programming
Solve → 72Painting a Grid With Three Different ColorsHardDynamic Programming
Solve → 73Parallel Courses IIHardDynamic ProgrammingBit ManipulationGraph Theory
Solve → 74Knight DialerMediumDynamic Programming
Solve → 75Sort Integers by The Power ValueMediumDynamic ProgrammingMemoizationSorting
Solve → 76The Earliest and Latest Rounds Where Players CompeteHardDynamic ProgrammingMemoization
Solve → 77Integer ReplacementMediumDynamic ProgrammingGreedyBit Manipulation
Solve → 78Unique Binary Search Trees IIMediumDynamic ProgrammingBacktrackingTree
Solve → 79Counting BitsEasyDynamic ProgrammingBit Manipulation
Solve → 80Paint FenceMediumDynamic Programming
Solve → 81All Possible Full Binary TreesMediumDynamic ProgrammingTreeRecursion
Solve → 82Minimum Number of Days to Eat N OrangesHardDynamic ProgrammingMemoization
Solve → 83Number of Ways to Arrive at DestinationMediumDynamic ProgrammingGraph TheoryTopological Sort
Solve → 84Number of Restricted Paths From First to Last NodeMediumDynamic ProgrammingGraph TheoryTopological Sort
Solve → 85Number of Ways to Stay in the Same Place After Some StepsHardDynamic Programming
Solve → 86Count Ways to Distribute CandiesHardDynamic Programming
Solve → 87Minimum Flips in Binary Tree to Get ResultHardDynamic ProgrammingTreeDepth-First Search
Solve → 88Maximum Score After Applying Operations on a TreeMediumDynamic ProgrammingTreeDepth-First Search
Solve → 89Find the City With the Smallest Number of Neighbors at a Threshold DistanceMediumDynamic ProgrammingGraph TheoryShortest Path
Solve → 90Maximum Sum BST in Binary TreeHardDynamic ProgrammingTreeDepth-First Search
Solve → 91Number of People Aware of a SecretMediumDynamic ProgrammingQueueSimulation
Solve → 92Ways to Express an Integer as Sum of PowersMediumDynamic Programming
Solve → 93Find All Possible Stable Binary Arrays IMediumDynamic ProgrammingPrefix Sum
Solve → 94Number of ZigZag Arrays IHardDynamic ProgrammingPrefix Sum
Solve → 95Knight Probability in ChessboardMediumDynamic Programming
Solve → 96Number of Dice Rolls With Target SumMediumDynamic Programming
Solve → 97Number of Ways to Paint N × 3 GridHardDynamic Programming
Solve → 98K Inverse Pairs ArrayHardDynamic Programming
Solve → 99Binary Tree CamerasHardDynamic ProgrammingTreeDepth-First Search
Solve → 100Build Array Where You Can Find The Maximum Exactly K ComparisonsHardDynamic ProgrammingPrefix Sum
Solve → 101Count Ways To Build Good StringsMediumDynamic Programming
Solve → 102Minimum Operations to Reduce an Integer to 0MediumDynamic ProgrammingGreedyBit Manipulation
Solve → 103Non-negative Integers without Consecutive OnesHardDynamic Programming
Solve → 104Count Number of Ways to Place HousesMediumDynamic Programming
Solve → 105Count Beautiful NumbersHardDynamic Programming
Solve → 106Minimum Edge Reversals So Every Node Is ReachableHardDynamic ProgrammingDepth-First SearchBreadth-First Search
Solve →