1579. Remove Max Number of Edges to Keep Graph Fully Traversable - Day 30/30 Leetcode June Challenge
ฝัง
- เผยแพร่เมื่อ 22 ส.ค. 2024
- Larry solves and analyzes this Leetcode problem as both an interviewer and an interviewee. This is a live recording of a real engineer solving a problem live - no cuts or edits!
Problem: leetcode.com/p...
Twitch: / larryny
Discord: / discord
Instagram: / larrysomewhere
#leetcode #coding #programming
What edges did you manage to keep?
the necessary ones.
its funny how larry just casually dropped the path compressed Union and find method like nothing!
Last time i studied it i was so confused that i was scared of graphs. But i wanted my june batch so like did it again today!
Larry is GOAT.
Implemented the isConnected and union method wrongly 😭 Now i will not forget that changes should be made on the root parent and not the immediate parent in the union method and in the isConnected method we should use find instead of immediate parent comparison.
Thanks larry
The olympics is very exciting! 😃😃
What did you do 7 miles in the morning ?
yep!
@@Algorithmist holy shit, why do much cardio, do some weights aslo, its better that way..show physique also sometime, maybe it will inspire people to look good at old age, i assume u are 30+.. i might also start youtube if i get peel shredded
@@genghisda236 sir, in addition to cardio I do 3 sessions of weightlifting a week