
🚀 Today I learned the Jump Game problem
💡 Idea: Track the maximum reachable index while traversing the array
If current index > maxReach → we get stuck ❌
Else keep updating: maxReach = max(maxReach, i + nums[i])
⚡ TC: O(n)
📦 SC: O(1)
#DSA #GreedyAlgorithm #LeetCode

English














































