BFS level-order traversal
Return the level-order traversal of a binary tree as a list of lists.
Selection Sort Implementation
Implement selection sort to sort a list of numbers in ascending order.
Merge Two Sorted Lists
Write a function that merges two sorted lists into a single sorted list.
Delete Old Records
Filter a list of records by removing those with a date older than a given cutoff date.
Top N per group
Implement top_n_per_group that returns the top N scores for each group from a list of (group, score) pairs.
Argsort Indices
Implement a function that returns the indices that would sort a list of integers, with ties broken by original order.
Level Order Traversal
Implement a function that performs a level order traversal of a binary tree and returns node values as a list of lists.
Merge K Sorted Lists
Write a function that merges multiple sorted lists into a single sorted list.
Memory view slice
Implement chunk_list that splits a list into consecutive sublists of a given chunk size.
Showing 1–9 of 9 challenges · Data Structures & Algorithms
Data Structures & Algorithms — Python coding challenges
What you will find here
This page lists data structures & algorithms challenges — real Python problems you solve in the browser IDE with instant test feedback. Each challenge includes a clear brief, starter code, and automated checks.
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.