Insert into a Sorted List
Implement a function that inserts a value into a sorted list at the correct position using binary search.
Binary search
Return the index of target in a sorted list, or -1 if not present.
Longest increasing subsequence
Return the length of the longest strictly increasing subsequence.
Find Peak Element
Implement a function that returns the index of any peak element in an integer array.
Integer Square Root Floor
Implement a function that returns the greatest integer whose square is ≤ n, using only integer operations.
Binary Search Tree Class
Build a BinarySearchTree class and a sequence runner that executes a list of operations.
Delete Node in BST
Implement a function that deletes a key from a binary search tree and returns the new root.
Insert into BST
Implement insertion into a Binary Search Tree while maintaining BST properties.
Search in Rotated Array
Implement an efficient search in a rotated sorted array using modified binary search.
Interpolation Search
Implement interpolation search in Python on a sorted list of integers.
Ternary Search
Implement ternary search to locate the maximum of a discrete unimodal function.
Showing 11 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.