Practice Arena

Python Coding Challenges

Write real Python in the browser. Instant feedback. From beginner to expert.

925 challenges 556 easy 323 medium 46 hard
Graphs & Graph Algorithms medium

Minimum Height Trees

Given an undirected tree, find all root nodes that minimize the height of the tree.

graphs bfs topological
+30 pts 30m
Graphs & Graph Algorithms medium

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.

bfs strings graph
+25 pts 30m
Graphs & Graph Algorithms medium

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.

bfs graph string
+30 pts 30m
Recursion & Backtracking hard

Remove invalid parentheses

Given a string with parentheses and letters, return all valid strings after removing the minimum number of invalid parentheses.

backtracking parentheses string
+45 pts 40m
Greedy Algorithms medium

Candy Distribution

Compute the minimum total candies needed so that every child gets at least one and children with higher ratings than neighbors get more candies.

greedy arrays optimization
+20 pts 20m
Greedy Algorithms medium

Meeting Rooms Minimum

Given a list of meeting time intervals, compute the minimum number of conference rooms required.

greedy intervals sorting
+30 pts 25m
Greedy Algorithms medium

Boats to Save People

Given a list of people weights and a boat's weight limit, return the minimum number of boats required.

greedy two-pointers sorting
+25 pts 25m
Greedy Algorithms medium

Minimum Number of Arrows to Burst Balloons

Given balloon intervals, find the minimum number of arrows to burst all balloons by merging overlaps.

greedy sorting intervals
+25 pts 25m
Greedy Algorithms hard

Patching Array

Given a sorted array of positive integers and a target n, find the minimum number of patches to make every number from 1 to n representable as a subset sum.

greedy arrays prefix-sums
+40 pts 30m
Greedy Algorithms medium

Painter Partition Problem

Given board lengths and k painters, find the minimum possible maximum total length a painter must paint.

binary-search greedy array-partitioning
+20 pts 25m
Greedy Algorithms medium

Non-overlapping Intervals

Given a list of intervals, return the minimum number of intervals to remove to make the rest non-overlapping.

greedy intervals sorting
+20 pts 20m
Binary Search medium

Find Minimum in Rotated Sorted Array

Implement a function that finds the minimum element in a rotated sorted array of distinct integers in O(log n) time.

binary-search arrays rotation
+25 pts 30m
Binary Search medium

Koko Eating Bananas

Given piles of bananas and hours, find the minimum integer eating speed Koko needs to finish all piles within H hours.

binary-search arrays search
+25 pts 30m
Binary Search medium

Magnetic Force Packages

Given basket positions and k balls, find the largest possible minimum distance between any two balls.

binary-search greedy array
+30 pts 30m
Binary Search medium

Minimum Speed to Arrive on Time

Given commute distances and a time limit, compute the minimum integer speed so you arrive on time.

binary-search simulation math
+25 pts 30m
Binary Search medium

Minimum Days to Make Bouquets

Given bloomDay per flower, find the minimum day to make m bouquets each needing k adjacent flowers.

binary-search array search
+25 pts 20m
Binary Search medium

Minimum Limit of Balls in a Bag

Given an array of bag sizes and a number of allowed splits, find the minimum possible maximum bag size.

binary-search arrays optimization
+25 pts 25m
Two Pointers & Sliding Window easy

Best Time to Buy and Sell Stock

Given a list of daily stock prices, determine the maximum profit achievable by buying on one day and selling on a later day.

arrays sliding-window profit
+10 pts 15m
Two Pointers & Sliding Window hard

Minimum Window Substring

Implement a sliding window algorithm to find the minimum window substring containing all characters of a given pattern.

sliding-window two-pointers strings
+45 pts 35m
Two Pointers & Sliding Window easy

Reduce array to zero

Given an array of non-negative integers, each operation chooses two indices and subtracts 1 from each if both are positive. Return the minimum number of operations to reduce the array to all zeros, or -1 if impossible.

two-pointers arrays greedy
+10 pts 15m
Two Pointers & Sliding Window medium

Minimum Size Subarray Sum

Given an array of positive integers, return the minimal length of a contiguous subarray with sum at least target, or 0 if none exists.

sliding-window two-pointers array
+25 pts 30m
Two Pointers & Sliding Window hard

Minimum Window Subsequence

Given strings s and t, return the minimum window substring of s that contains t as a subsequence, or empty string if none exists.

sliding-window recursion dynamic-programming
+40 pts 35m
Two Pointers & Sliding Window medium

Boats to Save People – Two Pointer

Implement a function that returns the minimum number of boats needed to rescue everyone, given a weight limit and each boat carrying at most two people.

two-pointers sorting greedy
+25 pts 30m
Stacks & Queues medium

Sum of Subarray Minimums

Given an integer array, sum the minimum of all contiguous subarrays modulo 10^9+7.

stack array monotonic-stack
+30 pts 30m

Showing 25–48 of 53 challenges

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

  1. Pick a category — basics, algorithms, strings, and more
  2. Open a challenge, read the statement, and edit the starter code
  3. 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.