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.
I faced multiple rounds consisting of a screening interview and panel interviews where I was asked technical questions about my field. It was a great experience overall, everyone involved were really knowledgeable about their jobs and I will greatly enjoy working with them
Preguntas de entrevista [1]
Pregunta 1
Leetcode medium/hard questions and technical questions about your field
Envié una solicitud electrónica. Acudí a una entrevista en Apple en mar 2026
Entrevista
one 60 minute interview with engineer, typical leetcode style, and behavioral questions about my experience. explain devops, explain a technical challenge you faced and how you solved it
one 45 minute interview with hiring manager, behavioral/ technical questions only.