Search in Rotated Sorted Array (LC #33) is a Meta favorite. The array was sorted then rotated at some pivot. At least one half is always sorted. Compare arr[left] with arr[mid] to find which half is sorted. If target is in the sorted half's range, search there. Otherwise search the other half. This runs in time and space. Find Minimum in Rotated Sorted Array (LC #153) uses similar logic: binary search for where arr[mid] is greater than arr[mid+].
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
$ curl repovive.com/roadmaps/meta-interview-prep/sorting-searching/search-in-rotated-sorted-array
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████████████████████████████████████████████████████████████████████████████████████████████