0% completed

Flow

Flow of Making the Course

Graph Terminologies and Representations

Introduction to Graphs Adjacency List and Matrix Representations

Graph Traversals : Breadth - First Search

Graph Traversals : Depth - First Search

Topological Sorting

Topological Sorting Kahn's Topological Sorting Algorithm

Cycle Detection : Directed and Undirected Graphs

Cycle Detection in Directed Graphs Cycle Detection in Undirected Graphs

Disjoint Set Structures : Union Find

Union by Rank and Find by Optimized Path Compression

Union by Size and Find by Optimized Path Compression

How to recognise if it is a union find problem

Problem 1: Find the number of connected components

Solution 1: Find the number of connected components

Problem 2: Find the number of provinces

Solution 2: Find the number of provinces

Recommended Problems for more practice : Beginner/Easy Level

Problem 3: Number of Operations to connect network

Solution 3: Number of Operations to connect network

Problem 4: Redundant Connections

Solution 4: Redundant Connections

Problem 5: Sentence Similarity

Solution 5: Sentence Similarity

Problem 6: Estimate time when everyone became friends

Solution 6: Estimate time when everyone became friends

Problem 7: Validate Binary tree

Solution 7: Validate Binary tree

Problem 8: Evaluate Division

Solution 8: Evaluate Division

Problem 9: Lexicographically Smallest Equivalent String

Solution 9: Lexicographically Smallest Equivalent String

Problem 10: Minimize Hamming Distance After Swap Operations

Solution 10: Minimize Hamming Distance After Swap Operations

Recommended Problems for more practice : Intermediate Level

Minimum Spanning Tree

Prims Algorithm Kruskal's Algorithm

Shortest Path Finding Algorithms

Djikshtra's Algorithm Floyd - Warshall Algorithm Bellman Ford Algorithm

Articulation Points and Bridges

Find all bridges in a graph Find all Articulation Points in a graph

Biconnected Components

Strongly Connected Components

Strongly Connected Components Tarjan's Algorithm to find Strongly Connected Components

Eulerian Circuit

Eulerian Path and Eulerian Circuits for a graph

Bipartite Graphs

What is Graph Bipartite?Determine if graph is Bipartite : Union Find Determine if graph is Bipartite : Node Coloring Determine if graph is Bipartite : DFS

Important Graph Algorithms

Flood Fill Algorithms Hamiltonian Paths A* Search Max Flow Minimum Flow Maximum Cut Min-Cut Mother Vertex of a Graph Transitive Closure of the graph

Miscellaneous Problems: Intermediate and Advanced Levels

Problem 1:Problem 2:Problem 3:Problem 4:Problem 5:

...

/

Problem 7: Validate Binary tree

Problem 7: Validate Binary tree

You have n binary tree nodes numbered from 0 to n - 1 where node i has two children leftChild[i] and ...

Create a free account to access the full course.

By signing up, you agree to Educative's Terms of Service and Privacy Policy