Codejeet
Blog
Tracker
System Design
Home
/
Companies
/
Infosys
/
Binary Search
Infosys Binary Search Questions
12 binary search problems asked at Infosys interviews
Easy (3)
Medium (6)
Hard (3)
Questions
Title
Difficulty
Acceptance
Frequency
Find Building Where Alice and Bob Can Meet
Hard
52.2%
94.9%
Maximize the Minimum Game Score
Hard
26.0%
86.1%
Two Sum II - Input Array Is Sorted
Medium
64.6%
54.6%
Sqrt(x)
Easy
41.4%
54.6%
Missing Number
Easy
71.7%
54.6%
Single Element in a Sorted Array
Medium
59.2%
54.6%
Find Minimum in Rotated Sorted Array
Medium
53.8%
50.9%
Median of Two Sorted Arrays
Hard
46.0%
44.3%
Find the Duplicate Number
Medium
64.0%
44.3%
Koko Eating Bananas
Medium
49.7%
44.3%
Search in Rotated Sorted Array
Medium
44.1%
44.3%
Binary Search
Easy
60.5%
44.3%
Showing 12 questions
All Infosys Questions
All Binary Search Questions