Leetcode 1613. Find the Missing IDs

Given an unsorted array of integer IDs (possibly with duplicates) and a known expected ID range, find all IDs in that range that do not appear in the array. The challenge is to return the missing IDs efficiently for large inputs, typically using linear-time and low-extra-space techniques.