given the array [1,4,3,0,0,5] wouldnt your solution fail?
2024-10-02 09:57:48
27
Dumpsterfoodainthalfbad :
Can someone explain to me what is happening in the code with “if i + nums[i] >= goal”?
2024-10-07 07:42:23
0
David D. :
Think I’m in love with you 😂
2024-10-02 06:37:26
0
Ju-Ju :
Nooo it’s algorithms all over again 😨
2024-10-02 05:10:29
1
user6055729147471 :
I had the greedy solution to this one on my first go. Definitely the more intuitive approach
2024-10-03 04:17:15
1
PyCharm :
Loop between 2 and 3 after
2024-10-02 18:59:44
0
daylen_walker :
What about finding the fastest route (least number of “moves”)
2024-10-01 16:27:56
8
mauricio_barva :
nice video
2024-10-06 06:08:36
0
Анатолій :
check if all serieses of zeros can be jumped over. all positive numbers make a "bridge" to at least the next number.
2024-10-10 15:37:38
0
fpt3242 :
is it greedy?
2024-10-19 17:59:44
0
dssfsuper2 :
the problem only requires you to check wether you can reach the last one, so just maintain the farthest you can go and update it from left to right
2024-11-24 22:35:00
0
Disco :
So basically just check to see if it’s possible to reach the end first, and if it’s not, return false. If it is possible to reach the end, and check if it’s possible to reach the bridge to the end
2024-10-03 04:00:56
1
oil enthusiasт :
w break down thanks
2024-10-01 16:24:55
1
Marius :
what do you want to achieve?
2024-10-01 16:10:18
1
flowerboy :
@Clickety-Mick_Cr
2024-10-08 17:00:53
0
micstk :
😳😳😳
2024-10-02 21:41:09
0
espresso :
😁
2024-11-25 13:20:00
0
clement :
@naythan
2024-10-09 10:31:41
0
Greg Hogg :
Crush Coding Interviews at AlgoMap.io :)
2024-10-01 15:26:55
2
Andrew Hubbard779 :
At each node, x = max(node, x-1). Break if x=0
2024-10-02 23:00:32
0
Cobalt300z :
Leetcode was the worst thing to happen to the SWE career path. Useless tests to cull the applicant pool
2024-10-02 18:43:13
161
aaryan :
@Akash Palukuri bro ur cooked
2024-10-07 00:23:05
0
Levy :
I need to be this intelligent
2024-10-01 15:51:57
89
To see more videos from user @greghogg5, please go to the Tikwm
homepage.