Question:
You are given a rotated sorted array of unique integers, meaning the array was originally sorted in ascending order, but then some unknown number of elements were moved from the front to the back. Given this array, write a function search_rotated_array(nums: List[int], target: int) -> int
that returns the index of the target
in the array. If the target is not present, return -1
.
You must write an efficient solution with a time complexity of O(log n).