Grokking Graph Algorithms for Coding Interviews

Grokking Graph Algorithms for Coding Interviews

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)

12,357 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!

Annual Subscription

Get instant access to all current and upcoming courses for one year.

OR

Lifetime Access - This Course

Get lifetime access to this course only.

Discounted Prices for Your Region

Certification on completing the course.

Gift for lifetime

Course Content

• 10 Chapters • 117 Lessons

1.

Introduction

1 lesson

Course Overview

2.

Graph Basics

3 lessons

Introduction to Graph

Graph Representations

Graph as an Abstract Data Type (ADT)

3.

Graph BFS Traversal

17 lessons

Graph Traversal - Breadth First Search (BFS)

Shortest Path with Alternating Colors (medium)

Solution: Shortest Path with Alternating Colors

Jump Game III (medium)

Solution: Jump Game III

All Nodes Distance K in Binary Tree (medium)

Solution: All Nodes Distance K in Binary Tree

Shortest Path in Binary Matrix (medium)

Solution: Shortest Path in Binary Matrix

Word Ladder (hard)

Solution: Word Ladder

Minimum Genetic Mutation (medium)

Solution: Minimum Genetic Mutation

The Maze (medium)

Solution: The Maze

Bus Routes (hard)

Solution: Bus Routes

4.

Graph DFS Traversal

15 lessons

Graph Traversal - Depth First Search(DFS)

Keys and Rooms (medium)

Solution: Keys and Rooms

Time Needed to Inform All Employees (medium)

Solution: Time Needed to Inform All Employees

All Paths From Source to Target (medium)

Solution: All Paths From Source to Target

Find Eventual Safe States (medium)

Solution: Find Eventual Safe States

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

Solution: Reorder Routes to Make All Paths Lead to the City Zero

Coloring A Border (medium)

Solution: Coloring A Border

Critical Connections in a Network (hard)

Solution: Critical Connections in a Network

5.

Matrix Graphs

17 lessons

Introduction to Matrix Graphs

Number of Islands (easy)

Solution: Number of Islands

Biggest Island (easy)

Solution: Biggest Island

Number of Closed Islands (easy)

Solution: Number of Closed Islands

Nearest Exit from Entrance in Maze (medium)

Solution: Nearest Exit from Entrance in Maze

Shortest Bridge (medium)

Solution: Shortest Bridge

01 Matrix (medium)

Solution: 01 Matrix

Pacific Atlantic Water Flow (Medium)

Solution: Pacific Atlantic Water Flow

Number of Enclaves (medium)

Solution: Number of Enclaves

6.

Graph Theory

11 lessons

Introduction to Graph Theory

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

Solution: Find if Path Exists in Graph(easy)

Find the Town Judge (easy)

Solution: Find the Town Judge

Graph Valid Tree (medium)

Solution: Graph Valid Tree

Maximal Network Rank (medium)

Solution: Maximal Network Rank

Minimum Number of Vertices to Reach All Nodes(medium)

Solution: Minimum Number of Vertices to Reach All Nodes(medium)

7.

Union Find / DSU

13 lessons

Introduction to Union Find Pattern

Possible Bipartition (medium)

Solution: Possible Bipartition

Is Graph Bipartite? (medium)

Solution: Is Graph Bipartite?

Accounts Merge (medium)

Solution: Accounts Merge

Satisfiability of Equality Equation (medium)

Solution: Satisfiability of Equality Equation

Similar String Groups (hard)

Solution: Similar String Groups

Most Stones Removed with Same Row or Column (medium)

Solution: Most Stones Removed with Same Row or Column

8.

Topological Sort

15 lessons

Introduction to Topological Sort

Topological Sort (medium)

Solution: Topological Sort

Tasks Scheduling (medium)

Solution: Tasks Scheduling

Tasks Scheduling Order (medium)

Solution: Tasks Scheduling Order

All Tasks Scheduling Orders (hard)

Solution: All Tasks Scheduling Orders

Alien Dictionary (hard)

Solution: Alien Dictionary

Problem Challenge 1: Reconstructing a Sequence (hard)

Solution: Problem Challenge 1: Reconstructing a Sequence

Problem Challenge 2: Minimum Height Trees (hard)

Solution: Problem Challenge 2: Minimum Height Trees

9.

Shortest Path in Graph

13 lessons

Dijkstra's Algorithm

Bellman–Ford Algorithm

Floyd Warshall Algorithm

Cheapest Flights Within K Stops (medium)

Solution: Cheapest Flights Within K Stops

Network Delay Time (medium)

Solution: Network Delay Time

Path with Maximum Probability (medium)

Solution: Path with Maximum Probability

The Maze II (medium)

Solution: The Maze II

Path With Minimum Effort (hard)

Solution: Path With Minimum Effort

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)

Solution: Connecting Cities With Minimum Cost

Min Cost to Connect All Points (medium)

Solution: Min Cost to Connect All Points

Optimize Water Distribution in a Village (hard)

Solution: Optimize Water Distribution in a Village

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

Solution: Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree

Related Courses

Grokking the Coding Interview: Patterns for Coding Questions

Grokking the Coding Interview Patterns in Java, Python, JS, C++, C#, and Go. The most comprehensive course with 476 Lessons.

4.6

(69,299 learners)

New

Grokking Tree Coding Patterns for Interviews

Master essential tree coding patterns to excel in technical interviews and enhance your problem-solving skills.

4.2

(9,354 learners)

What people say about our courses

Annual Subscription

Get instant access to all current and upcoming courses for one year.

OR

Lifetime Access - This Course

Get lifetime access to this course only.

Discounted Prices for Your Region

Certification on completing the course.

Gift for lifetime

One-Stop Portal For Tech Interviews.

About Us

Contact Us

Become Affiliate

Become Contributor

Social

LEGAL

Terms of Service

RESOURCES

Copyright © 2025 Design Gurus, LLC. All rights reserved.

;