Greg Hogg
Region: CA
Thursday 11 April 2024 18:12:39 GMT
20866
799
12
19
Music
Download
Comments
traoreadam777 :
isn't this a dynamic programming technique? we solve backwards and eliminate most of the cases
2024-04-12 19:24:39
2
The Graverobber :
You can also solve it by taking maximum number of steps of current avaiable steps
2024-04-12 12:34:11
0
Greg Hogg :
This Salesforce Interview Question is called Jump Game, number 55 on Leetcode. Drop a like if you found this helpful :)
2024-04-11 18:13:40
4
Spare_Lights :
This is great. Makes me think - what if we can't traverse backwards? Then we'll have to use some kind of recursion, no?
2024-05-01 21:27:50
0
Ger :
Very very important question… now go do html and css
2024-05-05 05:35:31
1
Phillip 🇨🇦 :
👍👍👍
2024-04-14 07:51:43
0
Greg Hogg :
By the way, I offer 1 on 1 tutoring sessions for DSA / coding interviews. Email [email protected] if you'd like some help or guidance!
2024-04-11 18:16:11
0
tonimondejar1 :
there is a O(n logn)solution using dp with segment tree, if you can’t figure out the greedy aproach on the spot
2024-06-25 02:43:56
0
To see more videos from user @greghogg5, please go to the Tikwm
homepage.
