CodingMediumcod-g568

Subject Binary searchLevel Mid–Senior~18 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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]) → int

Examples

in[[3,4,5,1,2]]out1

What 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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.