The interview process began with a one-hour coding test. This test included two DSA questions. Following that, there was a cultural fit assessment. After these steps, I received a call for the interview, which was a one-hour meeting. During this interview, the interviewer asked me to solve two more DSA questions. One involved binary search with a twist, and the other was a straightforward dynamic programming problem on stocks.

You are given a sorted array where all integers occur twice, except for one.

You have to find the integer that occurs only once.

(Hint: The correct solution has a time complexity of O(log n), not O(n) using bitwise operators.)