Find minimum rotated sorted array
Given a sorted array rotated at an unknown pivot (no duplicates), return its minimum element.
Implement
find_min(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 25 min
solution.py
InputExpectedGot
[[3,4,5,1,2]]1not run yetsample