Loading
Loading
Sign in to keep a note here. It is free, and nobody else can see it.
Sign inExample 1
Stone 1 alone can hop 3, landing on the last stone.
Example 2
Sign in to open hints.
Struggling is where the learning happens. Open this once you have genuinely tried, or once the hints have run out.
O(n) time · O(1) space
Input. Run your code to watch it work on this input, one line at a time.
Running code is turned off on this deployment. You can still read the problem, write code, use hints and the visualizer.
Tab moves focus out of the editor. Press Ctrl+M to let Tab indent instead.
No results yet
Run your code against the sample tests, or submit to run the full suite.
Every route ends on stone 3, whose mark is 0.