You're right — if rotated $n$ times it's back to fully sorted, so the right half is also sorted and nums[mid] < nums[r] would push r to mid, which is fine because nums[l] would eventually be the minimum anyway.
The logic still holds; it just converges to $l=0$.
What makes you a good fit?
The following metrics were computed from 49 interview experiences for the Apple SWE Intern role.
Apple's interview process for their SWE Intern roles is very selective, failing most engineers who go through it.
Candidates reported having very good feelings for Apple's SWE Intern interview process.