Java

Represented ARRAY [] = [50, 11, 33, 21, 40, 50, 40, 40, 21]

Expected output after de-duplication ARRAY [] = [11, 21, 33, 40, 50]

Sort and deduplicate the array.

Write a solution that implements the function in such a way that your solution solves the problem with O(n log2(n)) time complexity overall and O(n) space complexity. Here, n is the length of the list of input integers (array). I believe the sorting routine that can be used here is Merge Sort. Please state as code comment which sorting routine you are using, sort the array with that algorithm and solve the de-duplication problem thereafter. Deduplication part of the solution in itself must adhere to O(n) time and O(1) space bounds.