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
Recursion & Backtracking medium

Combination Generator

Write a recursive function that returns all combinations of length k from a list of distinct integers.

recursion backtracking combinations
+25 pts 25m
Recursion & Backtracking medium

Permutations II

Return all distinct permutations of a list of integers that may include duplicates.

permutations backtracking deduplication
+25 pts 25m
Recursion & Backtracking medium

Subsets

Return all subsets (the power set) of a list of distinct integers.

recursion backtracking subsets
+20 pts 25m
Recursion & Backtracking medium

Partition Equal Subset Sum (Backtracking)

Write a function that uses backtracking to decide if a list of positive integers can be partitioned into two subsets with equal sum.

backtracking subset-sum partition
+25 pts 25m
Recursion & Backtracking medium

Combination Sum

Given a list of distinct positive integers and a target, return all unique combinations that sum to the target.

backtracking recursion combinations
+25 pts 30m
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

Queue Reconstruction by Height

Given shuffled pairs of (height, number_of_taller_people_in_front), reconstruct the original queue order.

greedy sorting insertion
+25 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
Greedy Algorithms medium

Max events attended

Given a list of events with start and end times, find the maximum number of non-overlapping events you can attend.

greedy interval-scheduling sorting
+20 pts 20m
Binary Search medium

Interpolation Search

Implement interpolation search in Python on a sorted list of integers.

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

Book Allocation: Minimize Maximum Pages

Implement a function that returns the minimized maximum pages when allocating a list of books to k students.

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

Find k Closest Elements to Target

Return exactly k elements from a sorted list that are closest to a given target, preserving order.

binary-search sorting two-pointers
+20 pts 20m
Two Pointers & Sliding Window medium

Interval List Intersections

Given two lists of sorted, disjoint intervals, return the list of intersections between them.

two-pointers intervals merging
+20 pts 20m
Two Pointers & Sliding Window medium

Binary Subarray with Sum

Given a binary list and a goal sum, count the number of subarrays that add up to that goal.

sliding-window two-pointers subarray
+20 pts 20m
Two Pointers & Sliding Window medium

Sliding Window Median

Given a list of integers and a positive window size k, return the median of each sliding window of length k.

sliding-window median sorting
+25 pts 25m
Stacks & Queues medium

Daily Temperatures

Given a list of daily temperatures, return for each day how many days until a warmer temperature appears.

stacks arrays monotonic-stack
+25 pts 25m
Heaps & Priority Queues medium

Top K Frequent Elements

Given a list of integers and a number k, return the k most frequent elements in descending order of frequency, with ties broken by larger value.

heap frequency counter
+20 pts 25m
Heaps & Priority Queues medium

Task Scheduler Heap

Given a list of tasks and a cooldown, find the minimum number of CPU intervals needed to schedule all tasks without violating the cooldown.

heap queue greedy
+30 pts 25m
Heaps & Priority Queues medium

Meeting Rooms II with Heaps

Given a list of meeting intervals, compute the minimum number of rooms required using a heap-based approach.

heap intervals greedy
+25 pts 20m
Linked Lists medium

Prepend a new head

Insert value at the front of the list.

linked-list lists pointers
+22 pts 20m
Linked Lists medium

Append a new tail

Add value after the last node.

linked-list lists pointers
+22 pts 20m
Linked Lists medium

Palindrome linked values

Check whether values read the same forwards and backwards.

linked-list lists pointers
+22 pts 20m
Linked Lists medium

Rotate list left by k

Move the first k nodes to the end (k may exceed length; use modulo).

linked-list lists pointers
+22 pts 20m

Showing 49–72 of 80 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

  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.