CodeUtility
Making your developer's life easier!

Graphs coding challenges

Practise graphs with 8 coding challenges, from easy to hard. Every challenge runs in your browser with instant tests, an AI review of your code and community solutions to compare.

Medium · 4 Hard · 4

Skills you'll practise: A* searchAdjacency listsBFSCycle detectionDAG DPDijkstra's algorithmDouble BFSGraph algorithmsGraph coloringHeuristicsKahn's algorithmKruskal's algorithm
  • Python · C++ · C#
  • Automated tests
  • AI code review
  • Community solutions
Programming
Programming fundamentalsFrom variables to recursion, for beginners
AI and machine learning
AI Learning HubNeural networks, ML and LLMs from scratch Neural networks from scratchNeurons, backpropagation and optimizers Machine learning from scratchRegression, classification and clustering Transformers and LLMs from scratchTokenizers, attention and text generation Classical AI and reinforcement learningSearch, games and reinforcement learning
226
Challenges
2
Solutions shared
3
Languages

All challenges

Search by topic, language, or difficulty.

8 challenges
Hard

Strongly Connected Components

Count groups of nodes that can all reach each other.

You'll learn Graph algorithmsTarjan or Kosaraju
AdvancedCompetitive-programmingGraphs
Python C++ C#
0 solved
No solutions yet
Medium

Shortest Weighted Routes

Find the minimum total route cost from city 1 to each city.

You'll learn Dijkstra's algorithmLazy deletion
GraphsPriority-queuesShortest-path
Python C++ C#
0 solved
No solutions yet
Hard

Longest Path in a DAG

Find the heaviest path in a task dependency graph.

You'll learn Topological orderDAG DP
AdvancedGraphsHackathonTopological-sort
Python C++ C#
0 solved
No solutions yet
Hard

Minimum Network Connection Cost

Choose undirected links so that every vertex can reach every other vertex, with minimum total cost.

You'll learn Kruskal's algorithmUnion-find
Disjoint-setsGraphsMinimum-spanning-tree
Python C++ C#
0 solved
No solutions yet
Hard

Course Schedule Order

Order courses so every prerequisite comes first.

You'll learn Kahn's algorithmCycle detection
AdvancedGraphsHackathonTopological-sort
Python C++ C#
0 solved
No solutions yet
Medium

Can We Split Into Two Teams?

Decide whether people can be assigned to two teams so that each listed pair is on opposite teams.

You'll learn Graph coloringBFS
BipartiteGraphs
Python C++ C#
0 solved
No solutions yet
Medium

Tree Diameter

A tree is a connected undirected graph with no cycles.

You'll learn Double BFSAdjacency lists
GraphsTrees
Python C++ C#
0 solved
No solutions yet
Medium

A* Search on a Weighted Grid

Find the cheapest path across a grid of terrain costs with A*, the search algorithm behind game and robot pathfinding.

You'll learn A* searchHeuristics
GraphsGridsShortest-pathai
Python C++ C#
0 solved
No solutions yet

Browse by topic

Browse by language