Missing Numbers Problem Statement

You are provided with an array called ARR, consisting of distinct positive integers. Your task is to identify all the numbers that fall within the range of the smallest and largest elements in the array but are not present in the array itself. The missing numbers need to be returned in a sorted order.

Example:

Input:

ARR = [4, 2, 9]

Output:

3 5 6 7 8

Explanation:

The numbers 3, 5, 6, 7, and 8 are within the range of the elements in ARR but are not found within the array itself.

Constraints:

• 1 <= T <= 10
• 1 <= N <= 10⁵
• 0 <= ARR[i] <= 150000

Note:

No need to print the output explicitly. Implement the function to return the result.