Determine whether the last position is reachable when each entry is a maximum forward jump.
A good solution should
- State the invariant or decision rule that makes the approach correct.
- Explain time and space costs in terms of input size and required output.
- Handle empty, minimal, duplicate, and boundary-shaped inputs.
Reasoning prompt
Maintain the farthest reachable index and stop if the scan passes it.
Use the linked judge for the canonical challenge. The examples above are compact TRT checks; create additional tests around the boundary most likely to break your invariant.