Practice Arena

Python Coding
Challenges

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

467 challenges 330 easy 120 medium 17 hard

All Easy Medium Hard

All Python Basics Strings & Text Lists & Arrays Dicts & Sets Functions & Closures OOP & Classes Data Structures & Algorithms Advanced Python Iterators & Generators Decorators & Context Managers Error Handling & Exceptions Regular Expressions Math & Number Theory Bit Manipulation Dynamic Programming Trees & Binary Trees Graphs & Graph Algorithms Recursion & Backtracking Greedy Algorithms Binary Search Two Pointers & Sliding Window Stacks & Queues Heaps & Priority Queues Linked Lists Matrix & 2D Arrays Datetime & Time Calculations Data Formats & Parsing SQL & SQLite Numpy & Vectorized Computing Cryptography & Hashing

OOP & Classes medium

Matrix addition operator

Implement a Matrix class that supports + and * operators.

OOP dunder matrix

OOP & Classes medium

Complex Number Class

Implement a Complex class supporting addition, subtraction, multiplication, division, equality, and string formatting.

classes magic-methods arithmetic

OOP & Classes medium

Class Method Factory

Create a class method factory that dynamically adds methods to a class based on a mapping of names to behaviors.

oop metaprogramming factory

OOP & Classes medium

Reentrant Lock Manager

Implement a ReentrantLock class with acquire, release, locked, owner, and helper functions that test thread-safety with real threads.

threading locking reentrant

Advanced Python medium

2D Vector dataclass

Implement a Vector2D dataclass with +, -, scalar *, dot product, and magnitude.

dataclass OOP math

Dynamic Programming medium

Levenshtein Distance

Implement the classic Levenshtein distance algorithm to measure string similarity.

strings dynamic-programming edit-distance

Dynamic Programming medium

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.

dynamic-programming strings levenshtein-distance

Dynamic Programming medium

0/1 Knapsack

Implement the classic 0/1 Knapsack dynamic programming solution to maximize value under a weight capacity.

dynamic-programming knapsack optimization

Showing 8 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.