Zero Out Duplicates and Sort

Problem

You are given an unsorted integer array of about 75 elements that may contain duplicates. Write a function that:

• Zeroes out duplicate values. If a value appears more than once, replace the duplicates with 0 in the array.
• Sorts the array in ascending order. After zeroing out the duplicates, sort the array.

Constraints

• The array will contain integers.
• The array size will be approximately 75 elements.

Examples

Example 1

Input: [4, 3, 2, 3, 1] Output: [1, 2, 4, 0]

• The number 3 appears twice, so it is replaced with 0.

Example 2

Input: [1, 1, 1, 2, 2] Output: [0, 0, 0, 0]

• All numbers are duplicates, so they are all replaced with 0.

Example 3

Input: [5, 3, 5, 5, 5, 4, 3, 4] Output: [0, 0, 3, 4, 0, 0]

• The numbers 5 and 3 appear more than once, so they are replaced with 0.

Hints

• Use a hash map or set to track the occurrences of each number.
• Iterate through the array and replace duplicates with 0.
• Sort the array after zeroing out duplicates.

Solution

Here is a sample solution in Python:

`python def zero_out_duplicates_and_sort(arr): seen = set() for i in range(len(arr)): if arr[i] in seen or arr[i] == 0: arr[i] = 0 else: seen.add(arr[i]) arr.sort() return arr

Example usage:

arr = [4, 3, 2, 3, 1] print(zero_out_duplicates_and_sort(arr)) # Output: [1, 2, 4, 0] `

This solution first uses a set to track seen numbers and replaces duplicates with 0. Then, it sorts the array in ascending order.