Remove duplicates (sorted)
Return a sorted list with duplicates removed.
Merge two sorted arrays
Merge two sorted arrays into one sorted array.
Insert into a Sorted List
Implement a function that inserts a value into a sorted list at the correct position using binary search.
Intersection of Two Lists
Given two lists, return a sorted list of unique elements that appear in both lists.
Merge Sorted Array In Place
Write a function that merges two sorted arrays into the first array in-place, keeping the result sorted.
Cartesian Product Pairs
Create a function that returns the Cartesian product of two lists as a sorted list of lists.
Showing 6 challenges · easy · Lists & Arrays
Lists & Arrays — Python coding challenges
What you will find here
This page lists lists & arrays 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.