Tree inorder generator
Write a generator function that yields a binary tree's node values in inorder traversal.
Graph DFS Generator
Implement a generator function that performs a depth-first traversal of a graph without recursion.
Binary Search Tree Class
Build a BinarySearchTree class and a sequence runner that executes a list of operations.
Binary Tree Inorder Traversal
Implement an inorder traversal function that returns node values in left-root-right order.
Preorder Traversal
Implement a function that returns the preorder traversal values of a binary tree.
Postorder Traversal
Implement a function that returns the postorder traversal of a binary tree as a list of node values.
Minimum Depth of Tree
Given a binary tree, compute the minimum depth from the root to the nearest leaf node.
Same Tree Check
Write a function that checks whether two binary trees are identical in structure and node values.
Keys and Rooms
A classic graph traversal challenge: check if all rooms are reachable from room 0 using keys found in visited rooms.
Diagonal Traverse Matrix
Implement a function that returns all elements of a matrix in diagonal zigzag order.
Showing 1–10 of 10 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.