Jump Game IV | Leetcode 1345 | BFS | Map | Super Simplified Explanation

In this video, we will solve Jump Game IV (Leetcode 1345) step by step.

📌 Approach:
BFS + Map: Treat each index as a node in an unweighted graph connected to i-1, i+1, and all indices having the same value. Use BFS to find the shortest path, and clear the list of same-value indices after processing once to avoid repeatedly traversing the same group and achieve O(n) time complexity.
Problem: Jump Game IV
My solutions on Github (C++ & JAVA) : https://github.com/pragya9460/Leetcode/blob/main/Daily_Leetcode_Challenge/May-2026/18_Jump_Game_IV.java
Leetcode Link: https://leetcode.com/problems/jump-game-iv/

Lets code with pragya

1345. Jump Game IV

Leetcode today

May Leetcode Challenge Playlist: https://www.youtube.com/watch?v=kEi-bDZLZW8&list=PL78swWyrkuHnUd4pkI5TlfLMwynFuZQPU
My leetcode playlist: https://www.youtube.com/watch?v=kKswOr7jWpc&list=PL78swWyrkuHkUI9JVwJj_ltxxw_34MaIq&index=1

#leetcode #dsa #leetcodetoday #bruteforce #optimalsolution #optimization #beginners #beginner #leetcodepotd #leetcodechallenge #brute #linkedlist #list #dsa #array #bfs #dfs #map

Видео Jump Game IV | Leetcode 1345 | BFS | Map | Super Simplified Explanation канала Pragya Gupta