Binary searchMedium

Find Minimum in Rotated Sorted Array

nums is a sorted list of different numbers that was rotated some number of places. Find its smallest number in O(log n).

Aim for O(log n) time, O(1) spaceInspired by a classic interview problem ↗