Bug Report forhttps://neetcode.io/problems/find-minimum-in-rotated-sorted-array

Please describe the bug below and include any steps to reproduce the bug or screenshots if possible.?title=Bug Report for find-target-in-rotated-sorted-array

In this question, it says in the description that you can "Assume" there will be no duplicates in the array. Why is it so that we need the "nums[m] >= nums[l]" line?

Never mind, realized mid might be the same as left pointer at some point. Please close sorry late night. Not because it's identical but in same index.