# Jump Game III BFS Indices **Idea.** BFS indices with +arr[i]/-arr[i]. **Complexity.** State time and space before coding; most of these run in linear or n log n time. **Interview tip.** Restate constraints, give brute force first, then optimize. Trace one small example out loud before coding. *Disclosure: practice note shared by the Linkjob AI team.* For live mock-interview practice see [AI coding interview assistant](https://www.linkjob.ai/).