Greg Hogg
Region: CA
Thursday 23 May 2024 19:07:21 GMT
20641
963
29
22
Music
Download
Comments
Nameless :
this one isn't really self evident. should explain it
2024-05-24 00:43:29
25
Darth Vader :
I've always hated linked lists
2024-05-24 04:18:17
2
jlok :
why is it O(1) not O(n)?
2024-05-23 20:07:19
7
At🍗 :
What if -4 points to 3?
2024-05-24 08:10:07
0
Im Hassan580 :
In an interview, the interviewer is gonna know youve seen the problem before. No one is gonna come up with that solution.
2024-06-07 16:38:23
0
Wurstwasser :
the time complexity of the first approach is O(n log n)? Because we search the list of O(n) items we already visited?
2024-05-25 21:25:33
0
Bruno Moreira :
where do you find this problems? is it a site?
2024-05-23 19:44:07
1
Duy Phan1665 :
why leetcode grade the bettet solution worse?
2024-06-11 18:39:22
0
Greg Hogg :
Thank you for watching the video! Follow me on Instagram to keep these videos in your feed long after TikTok disappears :)
2024-05-23 19:09:33
1
PickleNiick :
Given head?? 😳😌
2024-05-23 22:46:01
17
sundermanhunter :
The only head I’m getting is in a linked list
2024-05-23 20:05:18
22
To see more videos from user @greghogg5, please go to the Tikwm
homepage.
