Greg Hogg
Region: CA
Wednesday 26 February 2025 16:00:20 GMT
48249
870
16
22
Music
Download
Comments
🐱 :
ok? where is the question you just explain what bfs is
2025-03-09 02:10:55
18
罗曼 :
is only one rotten orange at the beginning 😳
2025-03-09 04:50:47
0
DaV :
Isn’t this implying there’s only 1 rotten orange since if there’s more it would be quicker
2025-02-26 16:48:10
5
jpxfrd :
bro what is bfs
2025-02-26 22:44:17
1
RealMaxx9 :
😂
2025-02-27 16:58:39
0
Greg Hogg :
Learn it visually for FREE at Algomap.io!
2025-02-26 23:41:59
0
Greg Hogg :
Join 65k+ Developers Studying For Coding Interviews For FREE at Algomap.io!
2025-02-27 16:49:16
0
mikeokslong42069 :
yup thats and thats useful absolutely never in real world scenarios
2025-02-26 21:46:44
0
penissimian :
As the question is posed, you can just travel recursively right* and down, +1 on each step and +0 on the end case for a matrix of size n, n^2<
2025-02-26 17:25:57
5
To see more videos from user @greghogg5, please go to the Tikwm
homepage.
