Binary search
Return the index of target in a sorted list, or -1 if not present.
Exponential Search
Implement exponential search to find any valid index of a target in a sorted list.
Merge Two Sorted Lists
Write a function that merges two sorted lists into a single sorted list.
Jump Search
Implement the jump search algorithm to locate a target in a sorted list, returning its index or -1.
Showing 4 challenges · easy · 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.