Two Sum
Return indices (i, j) with i < j such that nums[i] + nums[j] == target.
Count Adjacent Pairs
Given a list of integers and a target, count adjacent pairs whose sum equals the target.
Running Total Window
Implement a function that returns a list of running totals, resetting to zero after each positive sum.
Showing 1–3 of 3 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.