RezloPrep

Interview PrepGraphs

0% read · 0 of 63 topics

GraphsDSA

Graph Algorithms

0% read0 of 63 topics

1. Graph Basics & Traversal0/10

Number of IslandsSoon

Clone GraphSoon

Flood FillSoon

Max Area of IslandSoon

Find if Path Exists in GraphSoon

Keys and RoomsSoon

All Paths From Source to TargetSoon

Pacific Atlantic Water FlowSoon

BFS of GraphSoon

DFS of GraphSoon

2. BFS / Shortest Path0/10

Word LadderSoon

Open the LockSoon

Shortest Path in Binary MatrixSoon

01 MatrixSoon

Minimum Knight MovesSoon

Snakes and LaddersSoon

Rotting OrangesSoon

Number of EnclavesSoon

Number of Distinct IslandsSoon

Word Ladder IISoon

3. DFS / Connected Components0/7

Number of Connected Components in an Undirected GraphSoon

Number of ProvincesSoon

Surrounded RegionsSoon

Graph Valid TreeSoon

Accounts MergeSoon

Making A Large IslandSoon

Reconstruct ItinerarySoon

4. Cycle Detection0/8

Course ScheduleSoon

Course Schedule IISoon

Redundant ConnectionSoon

Redundant Connection IISoon

Detect Cycle in an Undirected GraphSoon

Detect Cycle in a Directed GraphSoon

Is Graph Bipartite?Soon

Find Eventual Safe StatesSoon

5. Topological Sort0/6

Alien DictionarySoon

Sequence ReconstructionSoon

Parallel CoursesSoon

Minimum Height TreesSoon

Topological SortSoon

Kahn's AlgorithmSoon

6. Union Find / DSU0/4

Most Stones Removed with Same Row or ColumnSoon

Number of Operations to Make Network ConnectedSoon

Disjoint Set (Union by Rank & Path Compression)Soon

Number of Islands IISoon

7. Shortest Path (Weighted)0/13

Shortest Path in Undirected Graph with Unit DistanceSoon

Shortest Path in Directed Acyclic GraphSoon

Dijkstra's AlgorithmSoon

Print Shortest PathSoon

Network Delay TimeSoon

Path With Minimum EffortSoon

Cheapest Flights Within K StopsSoon

Minimum Multiplications to Reach EndSoon

Number of Ways to Arrive at DestinationSoon

Bellman-Ford AlgorithmSoon

Floyd Warshall AlgorithmSoon

Find the City With the Smallest Number of Neighbors at a Threshold DistanceSoon

Shortest Distance in a Binary MazeSoon

8. Minimum Spanning Tree0/2

Minimum Spanning Tree (Prim's & Kruskal's)Soon

Min Cost to Connect All PointsSoon

9. Bridges, Articulation Points & SCC0/3

Critical Connections in a NetworkSoon

Articulation PointSoon

Strongly Connected Components (Kosaraju's Algorithm)Soon

Number of Islands

This lesson is coming soon. Browse the rest of the Graphs syllabus in the sidebar.