Sherlok and Watson
CodeChefOpen on judge ↗
Watson performs an operation called Right Circular Rotation on an integer array [a0,a1,...an−1]. Right Circular Rotation transforms the array from [a0,a1,...an−1] to [aN−1,a0,...,aN−2]. He performs the operation K times and tests Sherlock's ability to identify the element at a particular position in the array. He asks Q queries. Each query consists of one integer, idx, for which you have to prin
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start