Ep.3: Graphs - LeetCode Problems That Got Me Hired

In this video, I discuss some basic and essential graph algorithms to know for coding interviews. I also dive into the similarities and differences between four problems: Number of Connected Components in an Undirected Graph, Course Schedule, Possible Bipartition, and Minimum Height Trees.

In this series, I dissect crucial coding interview patterns and discuss LeetCode problems I've done (while prepping for my own interviews) that I think are particularly essential. My goal is not to make tutorials on specific problems, but to highlight key takeaways and expose underlying algorithmic patterns.

⏲ Timestamps ⏲
0:00 - Introduction
0:59 - Overview
4:27 - Number of Connected Components in an Undirected Graph
8:26- Course Schedule
15:50 - Possible Bipartition
20:47 - Minimum Height Trees
25:29 - Closing Thoughts

🛒 My Gear and Resources 🛒
Cracking the Coding Interview: https://amzn.to/3lEXKw3
MacBook Pro (16-inch): https://amzn.to/2Iq0MXe
AirPods Pros: https://amzn.to/38wEtd5
Neewer USB LED Video Lights: https://amzn.to/3pm9uGT
Angetube 1080p HD Webcam: https://amzn.to/32CRuhz
Fifine USB Microphone: https://amzn.to/38wW9Fs

😬 About Me 😬
I'm a software engineer at Google, where I previously interned for two summers. I recently graduated from college as a computer science major. Now I sit in my room and talk to my camera to compensate for the fact that I have no social life.

🎵 Music 🎵
A Tribe Called Tenz by Ruck P https://chll.to/71129694
Cloud Dance by Blue Wednesday, Ian Ewing https://chll.to/f129f814

Видео Ep.3: Graphs - LeetCode Problems That Got Me Hired канала Kenny Yuan