Rotated Array Search II
Implement a function to search for a target in a rotated sorted array with possible duplicates.
Kth Smallest in Sorted Matrix
Implement kth_smallest(matrix, k) to return the kth smallest element in a row- and column-sorted square matrix.
Search 2D Matrix
Given a sorted 2D matrix with sorted rows and first element of each row greater than last of previous, find target efficiently.
First Bad Version
Implement a function to find the first bad version in a sorted range using binary search.
Find k Closest Elements to Target
Return exactly k elements from a sorted list that are closest to a given target, preserving order.
Sort Colors (Dutch National Flag)
Implement the Dutch National Flag algorithm to sort an array of 0, 1, 2 in one pass.
Reverse Pairs Count
Implement a function to count reverse pairs in an array efficiently.
Two Sum Sorted
Given a 1-indexed sorted array and a target, return the two indices that add up to the target.
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.
Squares of Sorted Array
Implement a function that returns a sorted list of squares for a given non-decreasing integer array.
Interval List Intersections
Given two lists of sorted, disjoint intervals, return the list of intersections between them.
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.
Sliding Window Median
Given a list of integers and a positive window size k, return the median of each sliding window of length k.
Four Sum
Find all unique quadruplets in an array that sum to a given target.
Buildings with ocean view
Given building heights, return sorted indices of buildings that have a clear view of the ocean to their right.
Kth Largest Element in an Array (Heap Edition)
Implement a function that returns the kth largest element in an unsorted integer array using a heap.
Find K pairs with smallest sums
Given two sorted arrays and an integer k, return the k smallest pairs (u, v) with the smallest sums, sorted by sum.
Merge two sorted lists
Merge two ascending integer lists into one sorted list.
Search a 2D Matrix II
Implement an efficient search for a target in a matrix where each row and each column is sorted in ascending order.
Serialize dict to TOML-like
Convert nested Python dicts into a simplified TOML-like string with sorted keys, type-aware formatting, and flat table sections.
Customers Never Order
Given Customers and Orders tables, return the names of customers with no orders, sorted alphabetically, or None if all have ordered.
Showing 97–118 of 118 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
- 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.