Google Phone screening round
- Posted
- 7 May 2025
Summary
I had a phone screening round with Google, where I was presented with a unique data structures and algorithms question regarding binary search in an unsorted array.
How it went
Given an unsorted array, find out the numbers that are always findable if we apply binary search. Also instead of middle function, we are given f(l,r) which can return any index which lies in a range.
Input : 2,1,3,5,0,6 Output he told me to come up with. So I am not sure what is the correct answer
Questions asked (1)
- 01
Binary Search in Unsorted Array with Custom Midpoint Function
Data Structures & Algorithms
Given an unsorted array, find out the numbers that are always findable if we apply binary search. Also instead of middle function, we are given f(l,r) which can return any index which lies in a range.
Input : 2,1,3,5,0,6