Minimum in rotated array
An ascending array of distinct integers was rotated at an unknown pivot. Given the rotated array nums, return its minimum element in O(log n) time. Array length up to 5000; the array may not be rotated at all.
Implement
find_min_rotated(nums: list[int]) → intExamples
in
[[3,4,5,1,2]]out1What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 18 min
solution.py
InputExpectedGot
[[3,4,5,1,2]]1not run yetsample