BFS level-order traversal
Return the level-order traversal of a binary tree as a list of lists.
AST Visitor Lite
Implement a depth-first traversal of a simplified AST and return identifier names in order.
Same Tree Check
Write a function that checks whether two binary trees are identical in structure and node values.
Validate BST
Implement a function to determine if a binary tree is a valid Binary Search Tree.
Minimum Height Trees
Given an undirected tree, find all root nodes that minimize the height of the tree.
Showing 1–5 of 5 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.