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.
Integer Square Root Floor
Implement a function that returns the greatest integer whose square is ≤ n, using only integer operations.
Integer Square Root
Implement integer_sqrt(n) that returns the largest integer whose square is ≤ n.
Binary Search Tree Class
Build a BinarySearchTree class and a sequence runner that executes a list of operations.
Insert into BST
Implement insertion into a Binary Search Tree while maintaining BST properties.
Search Insert Position
Return the index where a target should be inserted into a sorted list to maintain order.
Lower Bound Binary Search
Implement binary search to find the first index where an element is not less than a given target.
Upper Bound Binary Search
Write a function that returns the index of the first element greater than a target in a sorted list.
Find Indices of Target in Sorted List
Given a sorted list and a target, return the indices of its first and last occurrence, or [-1, -1] if absent.
First Bad Version
Implement a function to find the first bad version in a sorted range using binary search.
Showing 1–11 of 11 challenges · easy
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.