filmov
tv
Graph Data Structure: Learn Graphs in 1 hour
Показать описание
Ready to take land a job at Top Tech companies like Microsoft, Apple, Stripe, Meta, Amazon, and many more?
This comprehensive course covers coding interviews, system design interviews, behavioral interviews, debugging interviews, job application strategies, and job offer negotiation. I will provide you with a powerful framework for each stage of the interview process. I created those frameworks from hundreds of interviews, many mistakes, and feedback provided by Top tech companies. I will encapsulate more than 5 years of interview experience in just an 8-hour course.
Besides, there is a full Data Structures and Algorithms section where I cover all you need to pass your coding interviews, including Stacks, Queues, Hash Maps, Trees, Graphs, Heaps, Tries, Linked Lists, and more!
Timecodes:
0:00 - Intro
0:29 - Graph Properties
2:20 - Adjacency Matrix
6:40 - Adjacency List
11:45 - Graph class
13:30 - Add Node
14:12 - Add Edge
16:25 - Unit tests
17:30 - Remove Node
20:00 - Remove Edge
22:10 - Print Graph
26:00 - Graph Traversal
26:40 - Depth First Traversal
30:46 - Breadth First Traversal
41:50 - Has Cycle
50:00 - Close
This comprehensive course covers coding interviews, system design interviews, behavioral interviews, debugging interviews, job application strategies, and job offer negotiation. I will provide you with a powerful framework for each stage of the interview process. I created those frameworks from hundreds of interviews, many mistakes, and feedback provided by Top tech companies. I will encapsulate more than 5 years of interview experience in just an 8-hour course.
Besides, there is a full Data Structures and Algorithms section where I cover all you need to pass your coding interviews, including Stacks, Queues, Hash Maps, Trees, Graphs, Heaps, Tries, Linked Lists, and more!
Timecodes:
0:00 - Intro
0:29 - Graph Properties
2:20 - Adjacency Matrix
6:40 - Adjacency List
11:45 - Graph class
13:30 - Add Node
14:12 - Add Edge
16:25 - Unit tests
17:30 - Remove Node
20:00 - Remove Edge
22:10 - Print Graph
26:00 - Graph Traversal
26:40 - Depth First Traversal
30:46 - Breadth First Traversal
41:50 - Has Cycle
50:00 - Close