1First Bad VersionEasyBinary SearchInteractive
Solve → 2First Bad VersionEasyBinary SearchInteractive
Solve → 3Maximize Spanning Tree Stability with UpgradesHardBinary SearchGreedyUnion-Find
Solve → 4Guess Number Higher or LowerEasyBinary SearchInteractive
Solve → 5Count Complete Tree NodesEasyBinary SearchBit ManipulationTree
Solve → 6First Bad VersionEasyBinary SearchInteractive
Solve → 7Count Complete Tree NodesEasyBinary SearchBit ManipulationTree
Solve → 8Kth Ancestor of a Tree NodeHardBinary SearchDynamic ProgrammingBit Manipulation
Solve → 9Minimize the Maximum Edge Weight of GraphMediumBinary SearchDepth-First SearchBreadth-First Search
Solve → 10Guess Number Higher or LowerEasyBinary SearchInteractive
Solve → 11My Calendar IIIHardBinary SearchDesignSegment Tree
Solve → 12Closest Binary Search Tree ValueEasyBinary SearchTreeDepth-First Search
Solve → 13Booking Concert Tickets in GroupsHardBinary SearchDesignBinary Indexed Tree
Solve → 14Minimize Maximum Component CostMediumBinary SearchUnion-FindGraph Theory
Solve → 15First Bad VersionEasyBinary SearchInteractive
Solve → 16Kth Ancestor of a Tree NodeHardBinary SearchDynamic ProgrammingBit Manipulation
Solve → 17Guess Number Higher or LowerEasyBinary SearchInteractive
Solve → 18Count Complete Tree NodesEasyBinary SearchBit ManipulationTree
Solve → 19My Calendar IIIHardBinary SearchDesignSegment Tree
Solve → 20Closest Binary Search Tree ValueEasyBinary SearchTreeDepth-First Search
Solve → 21Booking Concert Tickets in GroupsHardBinary SearchDesignBinary Indexed Tree
Solve → 22Minimize the Maximum Edge Weight of GraphMediumBinary SearchDepth-First SearchBreadth-First Search
Solve → 23Maximize Spanning Tree Stability with UpgradesHardBinary SearchGreedyUnion-Find
Solve → 24Minimize Maximum Component CostMediumBinary SearchUnion-FindGraph Theory
Solve →