1First Bad VersionEasyBinary SearchInteractive
Solve → 2Count Complete Tree NodesEasyBinary SearchBit ManipulationTree
Solve → 3First Bad VersionEasyBinary SearchInteractive
Solve → 4Count Complete Tree NodesEasyBinary SearchBit ManipulationTree
Solve → 5First Bad VersionEasyBinary SearchInteractive
Solve → 6Guess Number Higher or LowerEasyBinary SearchInteractive
Solve → 7Count Complete Tree NodesEasyBinary SearchBit ManipulationTree
Solve → 8Kth Ancestor of a Tree NodeHardBinary SearchDynamic ProgrammingBit Manipulation
Solve → 9Minimum Time for K Connected ComponentsMediumBinary SearchUnion-FindGraph Theory
Solve → 10Maximize Spanning Tree Stability with UpgradesHardBinary SearchGreedyUnion-Find
Solve → 11First Bad VersionEasyBinary SearchInteractive
Solve → 12Count Complete Tree NodesEasyBinary SearchBit ManipulationTree
Solve → 13Guess Number Higher or LowerEasyBinary SearchInteractive
Solve → 14Kth Ancestor of a Tree NodeHardBinary SearchDynamic ProgrammingBit Manipulation
Solve → 15Maximize Spanning Tree Stability with UpgradesHardBinary SearchGreedyUnion-Find
Solve → 16Minimum Time for K Connected ComponentsMediumBinary SearchUnion-FindGraph Theory
Solve →