Majority Element Finder
Implement a function that returns the majority element in a list, which appears more than half the time.
Difference of Two Lists
Write a function that returns items in list a that are not in list b, preserving order and duplicates.
Counting Sort
Implement the counting sort algorithm to sort a list of non-negative integers in O(n + k) time.
Count Smaller Numbers
Given an integer list, return for each position how many later elements are smaller than it.
Count Adjacent Pairs
Given a list of integers and a target, count adjacent pairs whose sum equals the target.
Intersection two lists length
Return the number of distinct elements that appear in both input lists.
Showing 1–6 of 6 challenges · 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.