The first line contains a single integer T representing the number of test cases. The first line of each test case will contain the integer N. The second and last line contains N space-separated integers that denote the elements of the given array.
For each test case, return the new array that does not contain any duplicates of the input array. The output of each test case should be printed in a separate line.
You do not need to print anything; it has already been taken care of. Just implement the given function.
1 <= T <= 10 1 <= N <= 5*10^3 -10^5 <= arr[i] <= 10^5 Time Limit: 1 sec
We will traverse the whole array and check if that element previously occurred or not.
The steps are as follows:
Longest Subarray With Zero Sum
Merge Two Sorted Arrays Without Extra Space
Ninja And The Strictly Increasing Array
Negative To The End