Gahiz_

Binary Search

Challenges: 6Medium: 4Hard: 2

This Binary Search set gathers 6 coding problems, with a mix of 4 medium, 2 hard. They show up in interviews at companies like Amazon, Google, Microsoft, Orange Egypt, Instabug, so you can master the pattern once and recognize it everywhere.

Binary Search coding problems

  • Longest Increasing Subsequence

    Difficulty: HardAsked by: Amazon, Google, Microsoft

  • Max Sum with Increasing Constraint

    Difficulty: HardAsked by: Orange Egypt

  • Maximize Machines

    Difficulty: MediumAsked by: Instabug

  • Find Minimum in Rotated Sorted Array

    Difficulty: MediumAsked by: Siemens EDA

  • Search in Rotated Sorted Array

    Difficulty: MediumAsked by: Google, Meta, Microsoft

  • Validate Binary Search Tree

    Difficulty: MediumAsked by: Amazon, Google, Meta

Asked by

Ready to practice for real?

Work through Binary Search problems in the editor, run your code, and check your solution against real test cases.

Practice coding challenges, start free