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
Lists & Arrays hard

Sliding window maximum

Return the maximum of each window of size k as it slides across an array.

sliding-window deque arrays
+40 pts 35m
Data Structures & Algorithms hard

Median of Two Sorted Arrays

Given two sorted arrays, return the median of the combined sorted array in O(log(min(n,m))) time.

median binary search arrays
+45 pts 40m
Data Structures & Algorithms hard

Count of Range Sum

Count contiguous subarrays whose sum lies in a given inclusive range using an efficient divide-and-conquer algorithm.

prefix-sum merge-sort divide-conquer
+35 pts 40m
Dynamic Programming hard

Create Maximum Number

Given two arrays of digits and an integer k, merge them to form the largest number of length k.

arrays greedy dynamic-programming
+40 pts 35m
Dynamic Programming hard

Split Array Largest Sum

Minimize the largest sum among k contiguous subarrays using dynamic programming.

dynamic-programming binary-search arrays
+45 pts 40m
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

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