The interview started with my introduction, followed by the interviewer's.

Then we proceeded with the DSA question. Generally, they ask two medium questions, but for me, it was one medium question with a follow-up on that itself.

I answered the question partially and was not sure about the time and space complexity. That's why I got rejected :(

Given a binary array of 0s and 1s, you are provided with a function that takes l and r as inputs. This function returns a boolean answer: whether there exists a '1' in the range [l, r] or not. We need to find the indices of every occurrence of '1' in the array, using the minimum number of calls to the given function.