Adobe SWE Interview Question 2022 May | Binary Search | on-campus

Question 1 Problem Statement There is an integer array nums sorted in ascending order (with distinct values) that has been rotated at some unknown pivot index. Given the rotated array and an integer target, return the index of target if it is in nums, or -1 if it is not in nums. You must write an algorithm with O(log n) runtime complexity. Constraints 1 <= nums.length <= 5000 -104 <= nums[i] <= 104 All values in nums are unique nums ...