Leetcode 33. Search in Rotated Sorted Array

Given an ascending array of distinct integers that has been rotated at an unknown pivot, return the index of a target value (or -1 if absent) using an O(log n) search that accounts for the rotation.