1Binary Tree Maximum Path SumHardDynamic ProgrammingTreeDepth-First Search
Solve → 2Number of ZigZag Arrays IHardDynamic ProgrammingPrefix Sum
Solve → 3Binary Tree Maximum Path SumHardDynamic ProgrammingTreeDepth-First Search
Solve → 4Number of ZigZag Arrays IHardDynamic ProgrammingPrefix Sum
Solve → 5Cheapest Flights Within K StopsMediumDynamic ProgrammingDepth-First SearchBreadth-First Search
Solve → 6Binary Tree CamerasHardDynamic ProgrammingTreeDepth-First Search
Solve → 7Parallel Courses IIHardDynamic ProgrammingBit ManipulationGraph Theory
Solve → 8House Robber IIIMediumDynamic ProgrammingTreeDepth-First Search
Solve → 9Domino and Tromino TilingMediumDynamic Programming
Solve → 10Binary Tree Maximum Path SumHardDynamic ProgrammingTreeDepth-First Search
Solve → 11Cheapest Flights Within K StopsMediumDynamic ProgrammingDepth-First SearchBreadth-First Search
Solve → 12Number of ZigZag Arrays IHardDynamic ProgrammingPrefix Sum
Solve → 13Domino and Tromino TilingMediumDynamic Programming
Solve → 14Champagne TowerMediumDynamic Programming
Solve → 15House Robber IIIMediumDynamic ProgrammingTreeDepth-First Search
Solve → 16Binary Tree CamerasHardDynamic ProgrammingTreeDepth-First Search
Solve → 17Counting BitsEasyDynamic ProgrammingBit Manipulation
Solve → 18Minimum Edge Reversals So Every Node Is ReachableHardDynamic ProgrammingDepth-First SearchBreadth-First Search
Solve → 19Find All Possible Stable Binary Arrays IMediumDynamic ProgrammingPrefix Sum
Solve → 20Find All Possible Stable Binary Arrays IIHardDynamic ProgrammingPrefix Sum
Solve → 21Parallel Courses IIHardDynamic ProgrammingBit ManipulationGraph Theory
Solve → 22Binary Tree Maximum Path SumHardDynamic ProgrammingTreeDepth-First Search
Solve → 23House Robber IIIMediumDynamic ProgrammingTreeDepth-First Search
Solve → 24Cheapest Flights Within K StopsMediumDynamic ProgrammingDepth-First SearchBreadth-First Search
Solve → 25Binary Tree CamerasHardDynamic ProgrammingTreeDepth-First Search
Solve → 26Domino and Tromino TilingMediumDynamic Programming
Solve → 27Maximum Sum BST in Binary TreeHardDynamic ProgrammingTreeDepth-First Search
Solve → 28Unique Binary Search Trees IIMediumDynamic ProgrammingBacktrackingTree
Solve → 29Counting BitsEasyDynamic ProgrammingBit Manipulation
Solve → 30Number of Ways to Arrive at DestinationMediumDynamic ProgrammingGraph TheoryTopological Sort
Solve → 31Number of Dice Rolls With Target SumMediumDynamic Programming
Solve → 32Ways to Express an Integer as Sum of PowersMediumDynamic Programming
Solve → 33All Possible Full Binary TreesMediumDynamic ProgrammingTreeRecursion
Solve → 34Find the City With the Smallest Number of Neighbors at a Threshold DistanceMediumDynamic ProgrammingGraph TheoryShortest Path
Solve → 35Out of Boundary PathsMediumDynamic Programming
Solve → 36Number of People Aware of a SecretMediumDynamic ProgrammingQueueSimulation
Solve → 37Number of Ways to Paint N × 3 GridHardDynamic Programming
Solve → 38Shortest Path Visiting All NodesHardDynamic ProgrammingBit ManipulationBreadth-First Search
Solve → 39Knight DialerMediumDynamic Programming
Solve → 40Find Number of Coins to Place in Tree NodesHardDynamic ProgrammingTreeDepth-First Search
Solve → 41The Earliest and Latest Rounds Where Players CompeteHardDynamic ProgrammingMemoization
Solve → 42Minimum Operations to Reduce an Integer to 0MediumDynamic ProgrammingGreedyBit Manipulation
Solve → 43Champagne TowerMediumDynamic Programming
Solve → 44Sum of Distances in TreeHardDynamic ProgrammingTreeDepth-First Search
Solve → 45Longest ZigZag Path in a Binary TreeMediumDynamic ProgrammingTreeDepth-First Search
Solve → 46Count Ways To Build Good StringsMediumDynamic Programming
Solve → 47Painting a Grid With Three Different ColorsHardDynamic Programming
Solve → 48Integer ReplacementMediumDynamic ProgrammingGreedyBit Manipulation
Solve → 49Binary Tree Maximum Path SumHardDynamic ProgrammingTreeDepth-First Search
Solve → 50Cheapest Flights Within K StopsMediumDynamic ProgrammingDepth-First SearchBreadth-First Search
Solve → 51House Robber IIIMediumDynamic ProgrammingTreeDepth-First Search
Solve → 52Maximum Sum BST in Binary TreeHardDynamic ProgrammingTreeDepth-First Search
Solve → 53Binary Tree CamerasHardDynamic ProgrammingTreeDepth-First Search
Solve → 54Domino and Tromino TilingMediumDynamic Programming
Solve → 55Number of Dice Rolls With Target SumMediumDynamic Programming
Solve → 56Counting BitsEasyDynamic ProgrammingBit Manipulation
Solve → 57Unique Binary Search Trees IIMediumDynamic ProgrammingBacktrackingTree
Solve → 58Find Number of Coins to Place in Tree NodesHardDynamic ProgrammingTreeDepth-First Search
Solve → 59Number of Ways to Arrive at DestinationMediumDynamic ProgrammingGraph TheoryTopological Sort
Solve → 60Champagne TowerMediumDynamic Programming
Solve → 61Find the City With the Smallest Number of Neighbors at a Threshold DistanceMediumDynamic ProgrammingGraph TheoryShortest Path
Solve → 62Ways to Express an Integer as Sum of PowersMediumDynamic Programming
Solve → 63Number of ZigZag Arrays IHardDynamic ProgrammingPrefix Sum
Solve → 64All Possible Full Binary TreesMediumDynamic ProgrammingTreeRecursion
Solve → 65Out of Boundary PathsMediumDynamic Programming
Solve → 66Number of People Aware of a SecretMediumDynamic ProgrammingQueueSimulation
Solve → 67Shortest Path Visiting All NodesHardDynamic ProgrammingBit ManipulationBreadth-First Search
Solve → 68Knight DialerMediumDynamic Programming
Solve → 69Minimum Operations to Reduce an Integer to 0MediumDynamic ProgrammingGreedyBit Manipulation
Solve → 70Number of Ways to Paint N × 3 GridHardDynamic Programming
Solve → 71Count Ways To Build Good StringsMediumDynamic Programming
Solve → 72The Earliest and Latest Rounds Where Players CompeteHardDynamic ProgrammingMemoization
Solve → 73Minimum Edge Reversals So Every Node Is ReachableHardDynamic ProgrammingDepth-First SearchBreadth-First Search
Solve → 74Find All Possible Stable Binary Arrays IIHardDynamic ProgrammingPrefix Sum
Solve → 75Parallel Courses IIHardDynamic ProgrammingBit ManipulationGraph Theory
Solve → 76Sum of Distances in TreeHardDynamic ProgrammingTreeDepth-First Search
Solve → 77Longest ZigZag Path in a Binary TreeMediumDynamic ProgrammingTreeDepth-First Search
Solve → 78Painting a Grid With Three Different ColorsHardDynamic Programming
Solve → 79Integer ReplacementMediumDynamic ProgrammingGreedyBit Manipulation
Solve → 80Count Number of Ways to Place HousesMediumDynamic Programming
Solve → 81Non-negative Integers without Consecutive OnesHardDynamic Programming
Solve → 82Find All Possible Stable Binary Arrays IMediumDynamic ProgrammingPrefix Sum
Solve →