Question

Java 8

9m left Jav 27 28 ALL 29 0 Given an integer array, separate the values of the array into two subsets, A and B, whose intersection is null and where the addition of the two subsets equals the entire array. The sum of values in set A must be strictly greater than the sum of values in set B, and the number of elements in set A must be minimal. Return the values in set A in increasing order. If there are multiple possible solutions, return the set that has the maximum total sum of all its elements. WWW Example arr = [3, 7, 5, 6, 2] The divisions with the minimal 2 elements in subset A are [5, 7] and [6, 7). Of the two possible solutions, (6, 7) sums to the highest amount. Function Description Complete the subsetA function in the editor below. The function must return an integer array denoting the subset A. subsetA has the following parameter(s): arr int[]: an integer array Constraints • 1sns 105 • 1 s arr[i] s 105 (where O si<n)

Answer 1

package december;

import java.util.ArrayList;
import java.util.Arrays;

public class EmployeeTest {
  
   //this function will return an integer array, which will be a set of values
   public static int[] subsetA(int arr[]) {
      
       //sorting the original array
       Arrays.sort(arr);
      
       //calculating sum of all elements in the array
       int sum = 0;
       for(int a: arr)
           sum += a;
      
  
       int len = arr.length;
       //creating a array list that will store all the value of the set
       ArrayList<Integer> subsetA = new ArrayList<Integer>();
      
       //first step to add the last element of the array, which will be the largest of the array
       //since we need to keep the size minimum and sum of the subset maximum, so we will use a sorted values
       //and add values in the subset in decreasing order,
       //first we will check for the largerst then second largest and so on.
       subsetA.add(arr[len-1]);
      
       //this variable will store the sum of all the values in the subset
       int sumSubsetA = subsetA.get(0);
      
       //here, we will store the sum of all the values in array, considering we remove the values from the original array
       //and add them in the subset.
       int sumLeftInArray = sum - subsetA.get(0);
      
       //starting tghe loop from the second largest element of the array
       int i = len-2;
      
       //j will store the count of values in the subset
       int j = 1;
       while(sumSubsetA < sumLeftInArray) {
          
           //checking if the current element is same as last element entered in the subset
           //since in set all the elements are unique.
           if( arr[i] == subsetA.get(j-1)) {
               i--;
               continue;
           }
               subsetA.add(arr[i]);
               sumLeftInArray -= arr[i];
               sumSubsetA += arr[i];
               i--;
               j++;
       }
      
       int arrToRet[] = subsetA.stream().mapToInt(Integer:: intValue).toArray();
      
       return arrToRet;
      
   }
  
   public static void main(String[] args) {
       int arr[] = {3, 7, 5, 6, 2, 7};
       int []subset = subsetA(arr);
      
      
       System.out.println("Original Array: " + Arrays.toString(arr));
       System.out.println("Subset A: " + Arrays.toString(subset));
   }
}

<terminated> EmployeeTest [Java Application] C:\Program Files\AdoptOpenJDK\jdk-8.0.202.08\bin\javav þriginal Array: [2, 3, 5, 6, 7, 7] Subset A: [7, 6, 5]