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 hard

Swim in Rising Water

Find the minimum time needed to swim from the top-left to the bottom-right of a grid where water level rises and you can only move to cells with elevation ≤ current time.

graph minimax priority-queue
+30 pts 20m
Recursion & Backtracking hard

Partition to k subsets

Determine if an array of positive integers can be partitioned into k subsets of equal sum using backtracking.

backtracking recursion partition
+40 pts 35m
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
Recursion & Backtracking hard

Hamiltonian Cycle Backtrack

Implement a backtracking algorithm to find a Hamiltonian cycle in an undirected graph.

backtracking graph hamiltonian
+45 pts 40m
Greedy Algorithms hard

Remove K Digits to Form the Smallest Number

Given a non-negative integer as a string, remove exactly k digits to form the smallest possible integer without leading zeros.

greedy stack string
+45 pts 35m
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
Binary Search hard

Median of Sorted Array BS

Implement a binary search algorithm to find the median of two sorted arrays efficiently.

binary-search arrays median
+45 pts 35m
Binary Search hard

Kth Smallest in Sorted Matrix

Implement kth_smallest(matrix, k) to return the kth smallest element in a row- and column-sorted square matrix.

matrix binary-search heap
+40 pts 35m
Two Pointers & Sliding Window hard

Trapping Rain Water

Given an array of non-negative integers representing an elevation map, compute how much water it can trap after raining.

array two-pointers water-trapping
+40 pts 30m
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 hard

Subarrays with K different ints

Count the number of contiguous subarrays that contain exactly K distinct integers.

sliding-window two-pointers hashmap
+40 pts 40m
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
Linked Lists hard

Second node value

Return the second value or None if fewer than two nodes.

linked-list lists pointers
+35 pts 30m
Linked Lists hard

Drop the tail node

Return a new list without the last node.

linked-list lists pointers
+35 pts 30m
Linked Lists hard

Join node values with arrows

Format string node values as 'a -> b -> c'; empty list returns ''.

linked-list lists pointers
+35 pts 30m
Linked Lists hard

Insert value at index

Insert x at index i in a new list.

linked-list lists pointers
+35 pts 30m
Linked Lists hard

Compare two linked lists

Return True when both lists have identical values in order.

linked-list lists pointers
+35 pts 30m
Numpy & Vectorized Computing hard

Index of maximum value

Return index of largest value (first on tie).

vectors arrays numpy-style
+35 pts 30m
Numpy & Vectorized Computing hard

Add scalar to vector

Add constant k to every element of the vector.

vectors arrays numpy-style
+35 pts 30m
Numpy & Vectorized Computing hard

Inclusive numeric range vector

Return [start, start+step, ...] through end inclusive.

vectors arrays numpy-style
+35 pts 30m
Numpy & Vectorized Computing hard

Count elements in matrix

Return total scalar count.

vectors arrays numpy-style
+35 pts 30m
Numpy & Vectorized Computing hard

Binarize vector at threshold

Return 1.0 where v[i] >= t else 0.0.

vectors arrays numpy-style
+35 pts 30m

Showing 25–46 of 46 challenges · hard

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.