Merge Sort
Implement merge_sort(numbers) that returns a sorted copy of the input list using the merge sort algorithm.
Heap Sort Implementation
Implement the heap sort algorithm to sort a list of comparable elements in non-decreasing order.
Bucket Sort
Implement bucket sort to sort a list of floating-point numbers in the range [0,1).
Flood Fill Algorithm
Implement flood fill on a 2D grid using BFS/DFS.
Zeller Congruence Weekday
Implement a function that returns the weekday name for a given date using Zeller's congruence.
Extended Euclidean Algorithm
Implement the extended Euclidean algorithm to return (gcd, x, y) such that ax + by = gcd(a, b).
Maximum XOR Pair
Implement max_xor_pair(nums) that returns the maximum XOR value obtainable by pairing any two numbers in the given list.
Levenshtein Distance
Implement the classic Levenshtein distance algorithm to measure string similarity.
Edit Distance (Levenshtein Distance)
Implement the classic edit distance algorithm to find the minimum number of single-character edits required to transform one string into another.
Coin Change Minimum
Given coin denominations and a target amount, compute the minimum number of coins needed or -1 if impossible.
Bellman-Ford Algorithm
Implement the Bellman-Ford algorithm to compute shortest distances from a source in a directed weighted graph with up to 100 vertices and negative edges.
Prim's Minimum Spanning Tree
Given a connected undirected weighted graph, compute the total weight of its minimum spanning tree using Prim's algorithm.
Kruskal MST
Implement Kruskal's algorithm to compute the total weight of a minimum spanning tree in a connected undirected graph.
Strongly Connected Components (Kosaraju's Algorithm)
Implement a function to find strongly connected components in a directed graph using Kosaraju's algorithm.
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.
Sort Colors (Dutch National Flag)
Implement the Dutch National Flag algorithm to sort an array of 0, 1, 2 in one pass.
Julian Day Number Converter
Implement two functions to convert between Gregorian calendar dates and Julian Day Numbers using a standard formula.
Easter Date Calculator
Implement a function that returns the date of Easter Sunday for a given year using the Gregorian computus algorithm.
Showing 1–18 of 18 challenges · medium
Guide: free Python coding challenges
Practice Python by solving problems
PythonSkillset challenges are hands-on coding exercises from beginner to advanced. Open a challenge, read the problem, write Python in the split-pane editor, and run tests with Pyodide — no install required.
How to use the arena
- Pick a category — basics, algorithms, strings, and more
- Open a challenge, read the statement, and edit the starter code
- Run tests, fix failures, then try a related quiz or tutorial lesson
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.