Binary Search Interview Questions
242 real interview questions test Binary Search. Practice any of them in the code editor and get AI feedback on your solution.
- Junior10% (24)
- Mid/Senior54% (131)
- Staff36% (87)
Companies that ask Binary Search the most
Questionspage 3 of 3
- Maximum Score of a Good Subarray1 companyStaff
- Minimum Absolute Sum Difference1 companyMid/Senior
- Closest Room1 companyStaff
- Longest Common Subpath1 companyStaff
- Minimum Garden Perimeter to Collect Enough Apples1 companyMid/Senior
- Minimum Operations to Make the Array K-Increasing1 companyStaff
- Sum of Scores of Built Strings1 companyStaff
- Maximum Total Beauty of the Gardens1 companyStaff
- Number of Excellent Pairs1 companyStaff
- Maximum Number of Groups Entering a Competition1 companyMid/Senior
- Closest Nodes Queries in a Binary Search Tree1 companyMid/Senior
- Minimize the Maximum of Two Arrays1 companyMid/Senior
- Maximize Win From Two Segments1 companyMid/Senior
- Subsequence With the Minimum Score1 companyStaff
- Minimum Time to Complete All Tasks1 companyStaff
- Maximum Number of Groups With Increasing Length1 companyStaff
- Sorting Three Groups1 companyMid/Senior
- Maximize the Profit as the Salesman1 companyMid/Senior
- Minimum Array Length After Pair Removals1 companyMid/Senior
- Maximum Balanced Subsequence Sum1 companyStaff
- Minimum Cost to Make Array Equalindromic1 companyMid/Senior
- Earliest Second to Mark Indices I1 companyMid/Senior
- Minimum Sum of Values by Dividing Array1 companyStaff
- Maximum Points Inside the Square1 companyMid/Senior
- Find Products of Elements of Big Array1 companyStaff
- Find Subarray With Bitwise OR Closest to K1 companyStaff
- Number of Subarrays With AND Value of K1 companyStaff
- Minimum Number of Valid Strings to Form Target I1 companyMid/Senior
- Sorted GCD Pair Queries1 companyStaff
- Adjacent Increasing Subarrays Detection II1 companyMid/Senior
- Minimize the Maximum Adjacent Element Difference1 companyStaff
- Smallest Substring With Identical Characters II1 companyStaff
- Shortest Matching Substring1 companyStaff
- Path Existence Queries in a Graph I1 companyMid/Senior
- Path Existence Queries in a Graph II1 companyStaff
- Find Weighted Median Node in Tree1 companyStaff
- Minimum Stability Factor of Array1 companyStaff
- Minimum Time to Activate String1 companyMid/Senior
- Minimum Operations to Make Binary Palindrome1 companyMid/Senior
- Minimum K to Reduce Array Within Limit1 companyMid/Senior
- Minimum Operations to Transform Array into Alternating Prime1 companyMid/Senior
- Maximize Fixed Points After Deletions1 companyStaff