Kata 10: Find Duplicates
Find all elements that appear more than once in a list.
Rules
Write a function find_duplicates(nums) that:
- Returns a sorted list of all numbers that appear more than once
- Each duplicate appears only once in the result, even if it appears 5 times in the input
- Returns an empty list if there are no duplicates
Examples
find_duplicates([1, 2, 3, 2, 4, 3]) → [2, 3]
find_duplicates([1, 2, 3]) → []
find_duplicates([1, 1, 1, 1]) → [1]
find_duplicates([]) → []
Things to think about
- Use a dictionary to count how many times each number appears.
counts.get(num, 0)returns the current count fornum, or 0 if it has not been seen yet.- After counting, collect all keys where the count is greater than 1.
- Sort the result before returning it.
- Works with negative numbers too.
Initial Code
def find_duplicates(nums):
# your code here
pass
Evaluation Code
assert find_duplicates([1, 2, 3, 2, 4, 3]) == [2, 3], f"Got {find_duplicates([1,2,3,2,4,3])}"
assert find_duplicates([1, 2, 3]) == [], "No duplicates"
assert find_duplicates([1, 1, 1, 1]) == [1], "Same element many times appears once in result"
assert find_duplicates([]) == [], "Empty list"
assert find_duplicates([5, 5, 5, 3, 3, 1]) == [3, 5], "Should be sorted"
assert find_duplicates([4, 3, 2, 1]) == [], "All unique"
assert find_duplicates([1, 2, 1, 3, 2, 4, 3]) == [1, 2, 3]
assert find_duplicates([-1, -1, 2, 3]) == [-1], "Works with negatives"
result = find_duplicates([3, 1, 2, 1, 3])
assert result == sorted(result), "Result must be sorted"
print("All tests passed!")
Kata 10: Find Duplicates
Find all elements that appear more than once in a list.
Rules
Write a function find_duplicates(nums) that:
- Returns a sorted list of all numbers that appear more than once
- Each duplicate appears only once in the result, even if it appears 5 times in the input
- Returns an empty list if there are no duplicates
Examples
find_duplicates([1, 2, 3, 2, 4, 3]) → [2, 3]
find_duplicates([1, 2, 3]) → []
find_duplicates([1, 1, 1, 1]) → [1]
find_duplicates([]) → []
Things to think about
- Use a dictionary to count how many times each number appears.
counts.get(num, 0)returns the current count fornum, or 0 if it has not been seen yet.- After counting, collect all keys where the count is greater than 1.
- Sort the result before returning it.
- Works with negative numbers too.
Initial Code
def find_duplicates(nums):
# your code here
pass
Evaluation Code
assert find_duplicates([1, 2, 3, 2, 4, 3]) == [2, 3], f"Got {find_duplicates([1,2,3,2,4,3])}"
assert find_duplicates([1, 2, 3]) == [], "No duplicates"
assert find_duplicates([1, 1, 1, 1]) == [1], "Same element many times appears once in result"
assert find_duplicates([]) == [], "Empty list"
assert find_duplicates([5, 5, 5, 3, 3, 1]) == [3, 5], "Should be sorted"
assert find_duplicates([4, 3, 2, 1]) == [], "All unique"
assert find_duplicates([1, 2, 1, 3, 2, 4, 3]) == [1, 2, 3]
assert find_duplicates([-1, -1, 2, 3]) == [-1], "Works with negatives"
result = find_duplicates([3, 1, 2, 1, 3])
assert result == sorted(result), "Result must be sorted"
print("All tests passed!")
main.py
Loading...
Click "Run Code" when you are ready to test your solution.
