Leetcode - Search in Rotated Sorted Array II (Python)

[@paradox2738]

i mean if you the time complexity is o(N) why not just find it straight away with normal brute force

[@peskovdev]

Because there is no amortization, but now time complexity is Ω(logn)

[@oyalekephilip2203]

👍 Greats, Thanks for breaking it down , you're doing amazing stuff

[@timc3406]

Really appreciate it!!

[@haoyu6628]

Thank you Tim!