Partition around a pivot value
Implement an in-place partition of a list around a given pivot value, returning the boundary index.
Linked list reversal
Implement a singly linked list and a function to reverse it in place.
K Closest Elements
Implement a function to return the k closest elements to a target in a sorted array.
Delete Middle Node
Implement a function that deletes a given non-tail node from a singly linked list in O(1) time.
Ugly Number II
Given an integer n, return the nth ugly number using an efficient dynamic programming approach.
Boats to Save People
Given a list of people weights and a boat's weight limit, return the minimum number of boats required.
Bag of Tokens Score
Given tokens with values and initial power, determine the maximum score achievable by selling tokens for power or buying tokens for score.
Find k Closest Elements to Target
Return exactly k elements from a sorted list that are closest to a given target, preserving order.
Container With Most Water
Given an array of heights, find the maximum area between two vertical lines that can hold water.
Sort Colors (Dutch National Flag)
Implement the Dutch National Flag algorithm to sort an array of 0, 1, 2 in one pass.
Character Replacement Window
Given a string and a number k, find the length of the longest substring that can be made uniform by replacing at most k characters.
Permutation in String
Determine if any permutation of a shorter string appears as a contiguous substring in a longer string using an efficient sliding window.
Count Nice Subarrays
Given an array of integers, count the number of contiguous subarrays that contain exactly k odd numbers.
Reverse Pairs Count
Implement a function to count reverse pairs in an array efficiently.
Three Sum
Given an array of integers, return all unique triplets that sum to zero.
Closest Three Sum
Given an array of integers and a target, return the sum of three numbers that is closest to the target.
Interval List Intersections
Given two lists of sorted, disjoint intervals, return the list of intersections between them.
Minimum Size Subarray Sum
Given an array of positive integers, return the minimal length of a contiguous subarray with sum at least target, or 0 if none exists.
Fruit into Baskets
Given an array of integers representing fruit types, return the maximum number of fruits you can collect in a contiguous subarray with at most two distinct types.
Binary Subarray with Sum
Given a binary list and a goal sum, count the number of subarrays that add up to that goal.
Subarray product less than K
Count contiguous subarrays where the product of all elements is strictly less than a target K.
Boats to Save People – Two Pointer
Implement a function that returns the minimum number of boats needed to rescue everyone, given a weight limit and each boat carrying at most two people.
Trapping Rain Water (Two Pointers)
Given an array of non-negative integers representing elevation heights, compute how much water can be trapped after rain.
Four Sum
Find all unique quadruplets in an array that sum to a given target.
Longest Repeating Character Replacement
Given a string and an integer k, return the length of the longest substring that can be made of identical characters after at most k replacements.
Count Nice Subarrays
Count subarrays that contain exactly k odd numbers.
Showing 26 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.