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
Python Basics easy

Remove Duplicates from Sorted Array

Given a sorted list, remove duplicates in-place and return the new length.

lists in-place two-pointers
+10 pts 15m
Lists & Arrays medium

Rotate array

Rotate a list right by k positions in place.

arrays in-place
+20 pts 18m
Lists & Arrays easy

Move Zeros to the End

Reorder a list in-place, pushing all zeros to the end while preserving the order of non-zero numbers.

lists in-place two-pointer
+10 pts 15m
Lists & Arrays medium

Partition around a pivot value

Implement an in-place partition of a list around a given pivot value, returning the boundary index.

lists partition two-pointer
+20 pts 20m
Lists & Arrays easy

Move Zeros to End

Rearrange a list by moving all zeros to the end while preserving the relative order of non-zero elements.

list in-place two-pointer
+10 pts 15m
Lists & Arrays easy

Rearrange Positives and Negatives

Write a function that rearranges a list in-place so all negative numbers come before non-negative numbers.

in-place two-pointers partition
+10 pts 15m
Lists & Arrays easy

Move Zeroes

Implement move_zeroes(nums) that in-place moves all zeros to the end while maintaining the order of non-zero elements.

arrays in-place two-pointers
+10 pts 15m
Lists & Arrays easy

Merge Sorted Array In Place

Write a function that merges two sorted arrays into the first array in-place, keeping the result sorted.

arrays sorting in-place
+10 pts 15m
Lists & Arrays easy

Insertion Sort

Implement insertion sort that sorts a list in-place and returns the same list.

sorting in-place algorithms
+8 pts 12m
Data Structures & Algorithms easy

Selection Sort Implementation

Implement selection sort to sort a list of numbers in ascending order.

sorting selection-sort algorithm
+10 pts 15m
Data Structures & Algorithms medium

Heap Sort Implementation

Implement the heap sort algorithm to sort a list of comparable elements in non-decreasing order.

heap sorting in-place
+20 pts 25m
Data Structures & Algorithms easy

Shell Sort

Implement Shell sort, an in-place comparison sort that generalizes insertion sort, using a gap sequence that shrinks by half each pass.

sorting shell-sort in-place
+10 pts 15m
Data Structures & Algorithms medium

Delete Middle Node

Implement a function that deletes a given non-tail node from a singly linked list in O(1) time.

linked-list pointer in-place
+12 pts 15m
Data Structures & Algorithms medium

Delete duplicates sorted II

Given a sorted list, remove duplicates in place so each element appears at most twice, returning the new length.

arrays two-pointers in-place
+20 pts 20m
Two Pointers & Sliding Window medium

Sort Colors (Dutch National Flag)

Implement the Dutch National Flag algorithm to sort an array of 0, 1, 2 in one pass.

in-place two-pointers sorting
+20 pts 25m
Matrix & 2D Arrays easy

Rotate Image 90 Degrees Clockwise

Rotate a square matrix 90 degrees clockwise and return the rotated matrix.

matrix rotation in-place
+10 pts 15m
Matrix & 2D Arrays easy

Transpose Matrix In-Place

Implement a function that transposes a square matrix in-place and returns the transposed matrix.

matrix transpose in-place
+8 pts 12m
Matrix & 2D Arrays medium

Rotate Matrix Layers

Given a square matrix, rotate each concentric layer 90 degrees clockwise.

matrix rotation in-place
+25 pts 30m
Matrix & 2D Arrays easy

Flipping an Image

Implement a function that flips an image represented as a binary matrix by reversing each row and inverting each pixel.

matrix list-comprehension bitwise
+10 pts 15m

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