Grokking Graph Algorithms for Coding Interviews

Name: Grokking Graph Algorithms for Coding Interviews
Price: 58 USD
Availability: InStock
Rating: 3.9 (3287 reviews)

Unlock the secrets of graph algorithms and ace your coding interviews with confidence!

Level:

Beginner

Study Time:

50h

Lessons:

117

Playgrounds:

127

3.9

(3,287 ratings)

1,962 learners

Course Overview

This course is designed for software engineers, and anyone preparing for technical interviews at top-tier companies like FAANG. Whether you are a beginner or looking to deepen your understanding of graph algorithms, this course is for you. We start with the basics of graphs, including BFS and DFS traversal, matrix representations, and graph theory fundamentals. From there, we explore advanced topics such as Union-Find, topological sorting, shortest path algorithms (Dijkstra's, Bellman-Ford, Floyd-Warshall), and minimum spanning tree algorithms (Kruskal's, Prim's, Boruvka's). Each section includes detailed explanations and practical problems to enhance your learning experience. Our goal is to ensure you feel confident and well-prepared for your graph-related interview questions. The course content is tailored to reflect the types of questions you might encounter in real-world technical interviews, providing a solid foundation in graph data structures and algorithms. Join us to master graph theory and excel in your next coding interview!

Grokking Graph Algorithms for Coding Interviews Image

Best value

Lifetime access to this course

One-time payment. Yours forever.

$58

Discussions

Certificate

Free updates

Want all 36+ courses?

Best value

Lifetime access to this course

One-time payment. Yours forever.

$58

Discussions

Certificate

Free updates

Want all 36+ courses?

Course Content

• Chapters • 117 Lessons

Introduction

1 lessons

Course Overview

Graph Basics

3 lessons

Introduction to Graph

Graph Representations

Graph as an Abstract Data Type (ADT)

Graph BFS Traversal

17 lessons

Graph Traversal - Breadth First Search (BFS)

Shortest Path with Alternating Colors (medium)

Jump Game III (medium)

All Nodes Distance K in Binary Tree (medium)

Shortest Path in Binary Matrix (medium)

Word Ladder (hard)

Minimum Genetic Mutation (medium)

The Maze (medium)

Bus Routes (hard)

Graph DFS Traversal

15 lessons

Graph Traversal - Depth First Search(DFS)

Keys and Rooms (medium)

Time Needed to Inform All Employees (medium)

All Paths From Source to Target (medium)

Find Eventual Safe States (medium)

Reorder Routes to Make All Paths Lead to the City Zero (medium)

Coloring A Border (medium)

Critical Connections in a Network (hard)

Matrix Graphs

17 lessons

Introduction to Matrix Graphs

Number of Islands (easy)

Biggest Island (easy)

Number of Closed Islands (easy)

Nearest Exit from Entrance in Maze (medium)

Shortest Bridge (medium)

01 Matrix (medium)

Pacific Atlantic Water Flow (Medium)

Number of Enclaves (medium)

Graph Theory

11 lessons

Introduction to Graph Theory

Problem 1: Find if Path Exists in Graph(easy)

Find the Town Judge (easy)

Graph Valid Tree (medium)

Maximal Network Rank (medium)

Minimum Number of Vertices to Reach All Nodes(medium)

Union Find / DSU

13 lessons

Introduction to Union Find Pattern

Possible Bipartition (medium)

Is Graph Bipartite? (medium)

Accounts Merge (medium)

Satisfiability of Equality Equation (medium)

Similar String Groups (hard)

Most Stones Removed with Same Row or Column (medium)

Topological Sort

15 lessons

Introduction to Topological Sort

Topological Sort (medium)

Tasks Scheduling (medium)

Tasks Scheduling Order (medium)

All Tasks Scheduling Orders (hard)

Alien Dictionary (hard)

Problem Challenge 1: Reconstructing a Sequence (hard)

Problem Challenge 2: Minimum Height Trees (hard)

Shortest Path in Graph

13 lessons

Dijkstra's Algorithm

Bellman–Ford Algorithm

Floyd Warshall Algorithm

Cheapest Flights Within K Stops (medium)

Network Delay Time (medium)

Path with Maximum Probability (medium)

The Maze II (medium)

Path With Minimum Effort (hard)

10.

Minimum Spanning Tree

12 lessons

Introduction to Minimum Spanning Tree

Kruskal's Algorithm

Prim's Algorithm

Boruvka's Algorithm

Connecting Cities With Minimum Cost (medium)

Min Cost to Connect All Points (medium)

Optimize Water Distribution in a Village (hard)

Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree (hard)

What people say about our courses

Roger Cruz

Software Engineer

The world gets better inch by inch when you help someone else. If you haven't tried Grokking The Coding Interview, check it out, it's a great resource!

Simon Barker

Software Engineer

This is what I love about http://designgurus.io’s Grokking the coding interview course. They teach patterns rather than solutions.

Ashley Pean

Software Engineer

Check out Grokking the Coding Interview. Instead of trying out random Algos, they break down the patterns you need to solve them. Helps immensely with retention!

Eric

Software Engineer

I've completed my first pass of "grokking the System Design Interview" and I can say this was an excellent use of money and time. I've grown as a developer and now know the secrets of how to build these really giant internet systems.

Steven Zhang

Software Engineer

Just wanted to say thanks for your Grokking the system design interview resource (https://lnkd.in/g4Wii9r7) - it helped me immensely when I was interviewing from Tableau (very little system design exp) and helped me land 18 FAANG+ jobs!

Arijeet

Software Engineer

Just completed the “Grokking the system design interview”. It's amazing and super informative. Have come across very few courses that are as good as this!

The 24 essential patterns behind every coding interview question. Available in Java, Python, JavaScript, C++, C#, and Go. The most comprehensive coding interview course with 543 lessons. A smarter alternative to grinding LeetCode.

4.6