The interview was smooth, but the questions were quite tricky and could not be solved without thinking beyond the limits. Overall, the experience was very good. The interview panel was really helpful and tried to make the interview process cool.

She asked for binary search functionality to determine if an element exists in an array. Generally, the mid element is found using (low + high) / 2. She requested a change to use a random function to decide the mid element. Binary search is typically performed on a sorted array, but here an unsorted array was given. Two modifications were made to the binary search logic:

1. Instead of a sorted array, an unsorted array was provided.
2. The mid element is decided based on a random function.

Now, we need to find the numbers from the given array for which this function returns true.

Hint: The function will return true for value x if all numbers on the left side of x are smaller and all numbers on the right side of x are greater.