Search in Rotated Sorted Array - Neetcode 150

I think its easy to make mistakes on this question. Forgetting the equals when checking nums[lo] ≤ nums[mid] will make your answer wrong. This is necessary since if both lo and mid points to the same number, the search space of lo to mid is one element. And one element by definition, is sorted. Keep these small considerations in mind while coding fellas! Pre-requisite video:    • Find Minimum in Rotated Sorted Array - Nee...   Chapters: 0:00 Overview 0:51 Binary Search 6:45 Quit Condition 8:55 Coding Time #leetcode #neetcode #coding