Most Visited Position on a Sprint Track
A track has n numbered positions, from 1 through n. You are given an integer array sprints. A runner performs the following runs in order:
- Run from
sprints[i]tosprints[i + 1]for ever...
Example
Unlock to view complete problem details
and practice with sample input/output
Was this article helpful?
View Test Cases & Run Code requires membership
Standard Input
Execution Result: