Find in a Rotated Schedule
`nums` is a list of distinct integers that was sorted in ascending order and then rotated at some unknown pivot (e.g. `[0,1,2,4,5,6,7]` might become `[4,5,6,7,0,1,2]`). Given `nums` and a `target`, return its index, or -1 if it is not present. Aim for O(log n).
`nums` is a list of distinct integers that was sorted in ascending order and then rotated at some unknown pivot (e.g. `[0,1,2,4,5,6,7]` might become `[4,5,6,7,0,1,2]`). Given `nums` and a `target`, return its index, or -1 if it is not present. Aim for O(log n).
