Greg Hogg
Region: CA
Tuesday 23 April 2024 17:56:09 GMT
59537
898
10
29
Music
Download
Comments
Greg Hogg :
This problem is called Rotting Oranges, often asked by Amazon, number 994 on Leetcode.
2024-04-23 17:58:14
2
Issam :
Oh this reminds me of that time i did a masters in computer science. Now i push jira tickets around
2024-05-04 15:31:24
1
citharaaeternitaris :
You don't need to go minute by minute. Just run BFS from each initial rotten orange, keep the max depth assigned to any orange, and return that.
2024-04-23 19:58:57
22
ِ :
I don’t get it wheres the question? You just explained what happened
2024-05-27 02:16:22
3
Emmanuel :
Now do a 2d dp question
2024-04-28 08:16:09
0
Greg Hogg :
Thank you for watching, and kindly drop a like if you found this helpful!
2024-04-23 17:59:05
1
x_summasmiff_x :
is this conways game of life???
2024-05-04 19:09:29
0
Phillip 🇨🇦 :
👍👍👍
2024-05-06 02:56:43
0
Greg Hogg :
Also, please send an email to [email protected] if you're interested in 1 on 1 sessions with me to learn data structures and algorithms :)
2024-04-23 17:59:07
0
Greg Hogg :
Given an m*n grid of 0s (empty), 1s (fresh oranges) and 2s (rotting oranges), each minute the rotten oranges will rot any of their adjacent oranges.
2024-04-23 17:58:27
0
To see more videos from user @greghogg5, please go to the Tikwm
homepage.
