Python coding challenges: "matrix"

All Easy Medium Hard

All Python Basics Strings & Text Lists & Arrays Dicts & Sets Functions & Closures OOP & Classes Data Structures & Algorithms Advanced Python Iterators & Generators Decorators & Context Managers Error Handling & Exceptions Regular Expressions Math & Number Theory Bit Manipulation Dynamic Programming Trees & Binary Trees Graphs & Graph Algorithms Recursion & Backtracking Greedy Algorithms Binary Search Two Pointers & Sliding Window Stacks & Queues Heaps & Priority Queues Linked Lists Matrix & 2D Arrays Datetime & Time Calculations Data Formats & Parsing SQL & SQLite Numpy & Vectorized Computing Cryptography & Hashing

Graphs & Graph Algorithms easy

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.

graphs cliques adjacency-matrix

+10 pts 15m

Graphs & Graph Algorithms medium

Surrounded Regions

Given an M×N grid of 'X' and 'O', capture all regions of 'O' that are completely surrounded by 'X'.

graph bfs grid

+25 pts 30m

Graphs & Graph Algorithms medium

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.

graph shortest-path dynamic-programming

+25 pts 30m

Showing 1–3 of 3 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.

Python Coding Challenges