Daily challenge for 2026-08-29
606. Distinct ID Badges
You are given a list of integers badges representing employee ID badge numbers. Determine the minimum number of unique badge IDs that must be reassigned so that every remaining employee has a completely unique badge ID. In other words, find the number of duplicate badge IDs that need to be changed.
Example:
Input: badges = [101, 102, 101, 103, 102, 104]
Output: 2
Explanation: The badge IDs 101 and 102 appear twice. We need to reassign 2 badges so that all elements in the list are unique.
Run this challenge interactively in Python or JavaScript when the app loads.