Jump Game | (C++, Java, Python) |30 day Challenge | Day 25 | LeetCode #55

[@KnowledgeCenter]

Don't forget to share your solutions which worked for you. Thanks.

[@rakesht.j664]

public boolean canJump(int[] A) { int max= 0; for(int i=0;imax) { return false;} max = Math.max(A[i]+i,max); } return true; }

[@mohamedlamnaouar2175]

my solution in python : class Solution: def canJump(self, nums: List[int]) -> bool: if len(nums) == 0: return False if len(nums) == 1: return True j = len(nums) - 2 while j >= 0: cntZero = 0 while nums[j] == 0: cntZero += 1 j -= 1 if cntZero > 0: flag = True jump = 0 for j in range(j, -1, -1): if nums[j] >= cntZero + 1 + jump: flag = False break jump += 1 if flag == True: return False j -= 1 return True

[@williamwambua7710]

Nice job. It is somehow related to the problem on dynamic programming about the minimum jumps required to reach the end of the array.

[@umapathybabu8397]

class Solution { public boolean canJump(int[] nums) { int dp[]=new int[nums.length]; Arrays.fill(dp,-1); return helper(nums,0,dp); } boolean helper(int[] nums,int position,int dp[]){ if(position>=nums.length-1) return true; if(dp[position]!=-1) return dp[position]==1?true:false; int jumpLength = Math.min(nums[position]+position,nums.length); for(int i=position;i

[@srinish1993]

this is a classic dp question, but solved in greedy fashion.

[@indranilthakur3605]

It says this question could be solved by Greedy Algo as well. Which greedy algo you used?

[@ayushupadhyaya739]

sir please also give solutions of the atcoder beginner contest please

[@svendbentjensen5512]

KZbin need an "Indian Accent" tag so people can sort out these unbearable videos.