Asked about how to locate a element in an rotated, sorted array. You've been given an array that is sorted and then rotated. example Let arr = [1,2,3,4,5] which is sorted and then rotated say twice to the right to give [4,5,1,2,3] This can be done in O(logN) using a slightly modified binary search. The interesting property of a sorted + rotated array is that when you divide it into two halves, atleast one of the two halves will always be sorted. I am not interested in the groups of developing explorers, so I did not proceed.

It started with a 90-minute online assessment, followed by a technical phone screen with one engineer. The OA covered two medium-to-hard algorithm problems. For coding practice, I mainly rely on "LeetCode" to cover different topics. For company-specific interview preparation, I use "Hack2Hire", "LeetCode Discuss", and "1Point3Acres" to find any recent original questions. All of them are helpful platforms. The phone screen included one coding problem and some discussion around edge cases and time complexity.