Practice Coding Question | Real Coding Interviews

Quick Summary

Simulate a directional jump sequence on a 1D array where each leap depends on an alternating direction and a target height condition.
Identify the nearest valid landing index in the current direction without scanning the entire array repeatedly.
Return the final index where the traversal halts due to an unmet target or boundary constraint.

What This Tests

Common Patterns

SimulationHashingSortingBinary Search

Hint 1

Hint 2

Hint 3

What Interviewers May Ask Next

Report seen similar question in interview

Accepted

14/66

Acceptance Rate21.2%

Python3

Test Cases

Input

nums =

index =

x =

Output

Expected