The Silent Locator

A easy Python interview practice problem on DataDriven. Write and execute real python code with instant grading.

Domain

Python

Difficulty

easy

Seniority

L3

Problem

A read cache keeps record IDs in ascending order, but a maintenance job rotated the sequence at an unknown point, moving a block from the front to the back so the IDs now climb, wrap once, then climb again. Given this rotated `arr` of distinct IDs and a `target`, return the position of `target`, or -1 if it is absent, and keep the lookup logarithmic in the size of `arr`.

Summary

Every lookup should cost you less than the one before it.

Practice This Problem

Solve this Python problem with real code execution. DataDriven runs your Python code in a real environment and grades it automatically.