Javascript Program for Maximize elements using another array Last Updated : 17 Sep, 2024 Summarize Comments Improve Suggest changes Share Like Article Like Report Given two arrays with size n, maximize the first array by using the elements from the second array such that the new array formed contains n greatest but unique elements of both the arrays giving the second array priority (All elements of second array appear before first array). The order of appearance of elements is kept same in output as in input.Examples:Input : arr1[] = {2, 4, 3} arr2[] = {5, 6, 1} Output : 5 6 4 As 5, 6 and 4 are maximum elements from two arrays giving second array higher priority. Order of elements is same in output as in input.Input : arr1[] = {7, 4, 8, 0, 1} arr2[] = {9, 7, 2, 3, 6} Output : 9 7 6 4 8Approach: We create an auxiliary array of size 2*n and store the elements of 2nd array in auxiliary array, and then we will store elements of the 1st array in it. After that, we will sort auxiliary arrays in decreasing order. To keep the order of elements according to input arrays we will use a hash table. We will store 1st n largest unique elements of an auxiliary array in hash table. Now we traverse the second array and store the elements of second array in the auxiliary array that are present in hash table. Similarly, we will traverse first array and store the elements that are present in hash table. In this way we get n unique and largest elements from both the arrays in auxiliary array while keeping the order of appearance of elements same.Below is the implementation of above approach : JavaScript // Javascript program to print the maximum elements // giving second array higher priority // Function to maximize array elements function maximizeArray(arr1, arr2) { // auxiliary array arr3 to store // elements of arr1 & arr2 let arr3 = new Array(10); for (let i = 0; i < arr3.length; i++) { // arr2 has high priority arr3[i] = 0; } // Arraylist to store n largest // unique elements let al = []; for (let i = 0; i < arr2.length; i++) { if (arr3[arr2[i]] == 0) { // to avoid repetition of digits of arr2 in arr3 arr3[arr2[i]] = 2; // simultaneously setting arraylist to // preserve order of arr2 and arr3 al.push(arr2[i]); } } for (let i = 0; i < arr1.length; i++) { if (arr3[arr1[i]] == 0) { // if digit is already present in arr2 // then priority is arr2 arr3[arr1[i]] = 1; // simultaneously setting arraylist to // preserve order of arr1 al.push(arr1[i]); } } // to get only highest n elements(arr2+arr1) // and remove others from arraylist let count = 0; for (let j = 9; j >= 0; j--) { if (count < arr1.length & (arr3[j] == 2 || arr3[j] == 1)) { // to not allow those elements // which are absent in both arrays count++; } else { if (al.indexOf(j) > 0) al.splice(al.indexOf(j), 1); } } let i = 0; for (let x = 0; x < al.length; x++) { arr1[i++] = al[x]; } } // Driver Code let arr1 = [7, 4, 8, 0, 1]; let arr2 = [9, 7, 2, 3, 6]; maximizeArray(arr1, arr2); console.log(arr1); Output[ 9, 7, 6, 4, 8 ] Complexity Analysis:Time complexity: O(n * log n).Space Complexity: O(n) as list has been created.Please refer complete article on Maximize elements using another array for more details! Comment More infoAdvertise with us Next Article Java Program for Maximize elements using another array K kartik Follow Improve Article Tags : JavaScript cpp-unordered_set Similar Reads Javascript Program to Find maximum element of each row in a matrix Given a matrix, the task is to find the maximum element of each row.Examples: Input : [1, 2, 3] [1, 4, 9] [76, 34, 21]Output :3976Input : [1, 2, 3, 21] [12, 1, 65, 9] [1, 56, 34, 2]Output :216556Approach : Approach is very simple. The idea is to run the loop for no_of_rows. Check each element inside 2 min read Javascript Program for Largest Sum Contiguous Subarray Write an efficient program to find the sum of contiguous subarray within a one-dimensional array of numbers that has the largest sum. Kadane's Algorithm:Initialize: max_so_far = INT_MIN max_ending_here = 0Loop for each element of the array (a) max_ending_here = max_ending_here + a[i] (b) if(max_so_f 5 min read Javascript Program for Queries to find maximum sum contiguous subarrays of given length in a rotating array Given an array arr[] of N integers and Q queries of the form {X, Y} of the following two types: If X = 1, rotate the given array to the left by Y positions.If X = 2, print the maximum sum subarray of length Y in the current state of the array. Examples:Â Input: N = 5, arr[] = {1, 2, 3, 4, 5}, Q = 2, 5 min read Java Program for Maximize elements using another array Given two arrays with size n, maximize the first array by using the elements from the second array such that the new array formed contains n greatest but unique elements of both the arrays giving the second array priority (All elements of second array appear before first array). The order of appeara 3 min read Python3 Program for Maximize elements using another array Given two arrays with size n, maximize the first array by using the elements from the second array such that the new array formed contains n greatest but unique elements of both the arrays giving the second array priority (All elements of second array appear before first array). The order of appeara 4 min read C++ Program to Maximize elements using another array Given two arrays with size n, maximize the first array by using the elements from the second array such that the new array formed contains n greatest but unique elements of both the arrays giving the second array priority (All elements of second array appear before first array). The order of appeara 4 min read Like