# 17.05.2026 [1306. Jump Game III]

# 17.05.2026
[1306. Jump Game III](https://leetcode.com/problems/jump-game-iii/solutions/8254876/kotlin-rust-by-samoylenkodmitry-2q4i/) medium
[substack](https://open.substack.com/pub/dmitriisamoilenko/p/17052026-1306-jump-game-iii?r=2bam17&utm_campaign=post&utm_medium=web&showWelcomeOnShare=true)

#### Join me on Telegram

https://t.me/leetcode_daily_unstoppable/1362

#### Problem TLDR

Can reach 0 by jumping +a[i] - a[i]

#### Intuition

* Union-Find would not work - we have a strictly directed edges in graph
* BFS/DFS works

#### Approach

* use array itself as a visited set
* use 'camicadze' value to make it out of range and make less checks

#### Complexity

- Time complexity:
O(n)

- Space complexity:
O(n)

#### Code

https://dmitrysamoylenko.com/leetcode/

Видео # 17.05.2026 [1306. Jump Game III] канала KittyCat, Keyboard and LeetCode