You are given an integer array nums. The uniqueness array of nums is the sorted array that contains the number of distinct elements of all the subarrays of nums. In other words, it is a sorted array consisting of distinct(nums[i..j]), for all 0 <= i <= j < nums.length.Here, distinct(nums[i..j]) denotes the number of distinct elements in the subarray that starts at index i and ends at index j.Return the median of the uniqueness array of nums.Note that the median of an array is defined as the middle element of the array when it is sorted in non-decreasing order. If there are two choices for a median, the smaller of the two values is taken. Example 1:Input: nums = [1,2,3]Output: 1Explanation:The uniqueness array of nums is [distinct(nums[0..0]), distinct(nums[1..1]), distinct(nums[2..2]), distinct(nums[0..1]), distinct(nums[1..2]), distinct(nums[0..2])] which is equal to [1, 1, 1, 2, 2, 3]. The uniqueness array has a median of 1. Therefore, the answer is 1.Example 2:Input: nums = [3,4,3,4,5]Output: 2Explanation:The uniqueness array of nums is [1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3]. The uniqueness array has a median of 2. Therefore, the answer is 2.Example 3:Input: nums = [4,3,5,4]Output: 2Explanation:The uniqueness array of nums is [1, 1, 1, 1, 2, 2, 2, 3, 3, 3]. The uniqueness array has a median of 2. Therefore, the answer is 2. Constraints:1 <= nums.length <= 1051 <= nums[i] <= 105

Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same. Then return the number of unique elements in nums.Consider the number of unique elements of nums to be k, to get accepted, you need to do the following things:Change the array nums such that the first k elements of nums contain the unique elements in the order they were present in nums initially. The remaining elements of nums are not important as well as the size of nums.Return k.Custom Judge:The judge will test your solution with the following code:int[] nums = [...]; // Input arrayint[] expectedNums = [...]; // The expected answer with correct lengthint k = removeDuplicates(nums); // Calls your implementationassert k == expectedNums.length;for (int i = 0; i < k; i++) { assert nums[i] == expectedNums[i];}If all assertions pass, then your solution will be accepted. Example 1:Input: nums = [1,1,2]Output: 2, nums = [1,2,_]Explanation: Your function should return k = 2, with the first two elements of nums being 1 and 2 respectively.It does not matter what you leave beyond the returned k (hence they are underscores).Example 2:Input: nums = [0,0,1,1,1,2,2,3,3,4]Output: 5, nums = [0,1,2,3,4,_,_,_,_,_]Explanation: Your function should return k = 5, with the first five elements of nums being 0, 1, 2, 3, and 4 respectively.It does not matter what you leave beyond the returned k (hence they are underscores). Constraints:1 <= nums.length <= 3 * 104-100 <= nums[i] <= 100nums is sorted in non-decreasing order.

442. Find All Duplicates in an ArrayMediumTopicsCompaniesGiven an integer array nums of length n where all the integers of nums are in the range [1, n] and each integer appears once or twice, return an array of all the integers that appears twice.You must write an algorithm that runs in O(n) time and uses only constant extra space. Example 1:Input: nums = [4,3,2,7,8,2,3,1]Output: [2,3]Example 2:Input: nums = [1,1,2]Output: [1]Example 3:Input: nums = [1]Output: [] Constraints:n == nums.length1 <= n <= 1051 <= nums[i] <= nEach element in nums appears once or twice.

You are given an array of positive integers nums.Return the number of subarrays of nums, where the first and the last elements of the subarray are equal to the largest element in the subarray. Example 1:Input: nums = [1,4,3,3,2]Output: 6Explanation:There are 6 subarrays which have the first and the last elements equal to the largest element of the subarray:subarray [1,4,3,3,2], with its largest element 1. The first element is 1 and the last element is also 1.subarray [1,4,3,3,2], with its largest element 4. The first element is 4 and the last element is also 4.subarray [1,4,3,3,2], with its largest element 3. The first element is 3 and the last element is also 3.subarray [1,4,3,3,2], with its largest element 3. The first element is 3 and the last element is also 3.subarray [1,4,3,3,2], with its largest element 2. The first element is 2 and the last element is also 2.subarray [1,4,3,3,2], with its largest element 3. The first element is 3 and the last element is also 3.Hence, we return 6.Example 2:Input: nums = [3,3,3]Output: 6Explanation:There are 6 subarrays which have the first and the last elements equal to the largest element of the subarray:subarray [3,3,3], with its largest element 3. The first element is 3 and the last element is also 3.subarray [3,3,3], with its largest element 3. The first element is 3 and the last element is also 3.subarray [3,3,3], with its largest element 3. The first element is 3 and the last element is also 3.subarray [3,3,3], with its largest element 3. The first element is 3 and the last element is also 3.subarray [3,3,3], with its largest element 3. The first element is 3 and the last element is also 3.subarray [3,3,3], with its largest element 3. The first element is 3 and the last element is also 3.Hence, we return 6.Example 3:Input: nums = [1]Output: 1Explanation:There is a single subarray of nums which is [1], with its largest element 1. The first element is 1 and the last element is also 1.Hence, we return 1. Constraints:1 <= nums.length <= 1051 <= nums[i] <= 109

Given an integer array nums sorted in non-decreasing order, remove some duplicates in-place such that each unique element appears at most twice. The relative order of the elements should be kept the same.Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array nums. More formally, if there are k elements after removing the duplicates, then the first k elements of nums should hold the final result. It does not matter what you leave beyond the first k elements.Return k after placing the final result in the first k slots of nums.Do not allocate extra space for another array. You must do this by modifying the input array in-place with O(1) extra memory.

roblem statementGinny, an inquisitive mind fascinated by the intricacies of arrays, has posed a challenge for you. She needs a program that can identify and display the unique elements present in an array. Write a program that includes a function named findUniqueElements where the array is passed as an argument.Input format :The first line of input is an integer value 'N', representing the size of the array.The second line of input consists of N space-separated integers arr[i], representing the elements of the array.Output format :The output displays the integers, representing the unique elements identified within the array, separated by spaces.