Strongly Connected Components (Kosaraju's Algorithm)
Implement a function to find strongly connected components in a directed graph using Kosaraju's algorithm.
Clique Detection
Given an undirected graph and a list of vertices, check if every pair of distinct vertices in the list is connected by an edge.
Surrounded Regions
Given an M×N grid of 'X' and 'O', capture all regions of 'O' that are completely surrounded by 'X'.
Course Schedule Ordering
Determine a valid sequence to complete all courses respecting prerequisite constraints.
Minimum Height Trees
Given an undirected tree, find all root nodes that minimize the height of the tree.
Open the Lock BFS
Implement a BFS solution to find the minimum number of turns needed to open a 4-wheel lock, avoiding a set of deadends.
Minimum Genetic Mutation
Implement a function to compute the minimum number of single-character mutations needed to transform one gene string into another, using a given bank of valid mutations.
Possible bipartition
Given N people and a list of mutual dislikes, check if they can be divided into two groups with no dislike inside a group.
Graph Coloring Backtrack
Given an adjacency list and a number of colors, decide if the graph can be colored so no adjacent vertices share a color.
Android unlock patterns
Count the number of valid Android unlock patterns of a given length using a 3x3 grid with adjacency constraints.
Floyd-Warshall: All-Pairs Shortest Paths
Implement the Floyd-Warshall algorithm to find all-pairs shortest path distances in a directed graph with possibly negative weights but no negative cycles.
Jump Game on Graph
Implement a function that determines if you can reach the last node of a directed graph by jumping from node 0 to node n-1 using edges.
Most stones removed
Given stone coordinates on a grid, find the maximum number of stones that can be removed while every stone shares a row or column with another remaining stone.
Showing 25–37 of 37 challenges · Graphs & Graph Algorithms
Graphs & Graph Algorithms — Python coding challenges
What you will find here
This page lists graphs & graph algorithms challenges — real Python problems you solve in the browser IDE with instant test feedback. Each challenge includes a clear brief, starter code, and automated checks.
Challenges vs tutorials and quizzes
Challenges test what you can build under constraints. For guided teaching, use our Python tutorials. For quick checks, try quizzes or copy snippets from code samples.