Split array into two subarrays such that difference of their maximum is minimum
Last Updated :
20 Mar, 2023
Given an array arr[] consisting of integers, the task is to split the given array into two sub-arrays such that the difference between their maximum elements is minimum.
Example:
Input: arr[] = {7, 9, 5, 10}
Output: 1
Explanation:
The subarrays are {5, 10} and {7, 9} with the difference between their maximums = 10 - 9 = 1.
Input: arr[] = {6, 6, 6}
Output: 0
Approach:
We can observe that we need to split the array into two subarrays such that:
- If the maximum element occurs more than once in the array, it needs to be present in both the subarrays at least once.
- Otherwise, the largest and the second-largest elements should be present in different subarrays.
This ensures that the difference between the maximum elements of the two subarrays is maximized.
Hence, we need to sort the array, and then the difference between the largest 2 elements, i.e. arr[n - 1] and arr[n - 2], is the required answer.
Below is the implementation of the above approach:
C++
// C++ Program to split a given
// array such that the difference
// between their maximums is minimized.
#include <bits/stdc++.h>
using namespace std;
int findMinDif(int arr[], int N)
{
// Sort the array
sort(arr, arr + N);
// Return the difference
// between two highest
// elements
return (arr[N - 1] - arr[N - 2]);
}
// Driver Program
int main()
{
int arr[] = { 7, 9, 5, 10 };
int N = sizeof(arr) / sizeof(arr[0]);
cout << findMinDif(arr, N);
return 0;
}
// Java Program to split a given array
// such that the difference between
// their maximums is minimized.
import java.util.*;
class GFG{
static int findMinDif(int arr[], int N)
{
// Sort the array
Arrays.sort(arr);
// Return the difference between
// two highest elements
return (arr[N - 1] - arr[N - 2]);
}
// Driver code
public static void main(String[] args)
{
int arr[] = { 7, 9, 5, 10 };
int N = arr.length;
System.out.println(findMinDif(arr, N));
}
}
// This code is contributed by offbeat
# Python3 Program to split a given
# array such that the difference
# between their maximums is minimized.
def findMinDif(arr, N):
# Sort the array
arr.sort()
# Return the difference
# between two highest
# elements
return (arr[N - 1] - arr[N - 2])
# Driver Program
arr = [ 7, 9, 5, 10 ]
N = len(arr)
print(findMinDif(arr, N))
# This code is contributed by yatinagg
// C# Program to split a given array
// such that the difference between
// their maximums is minimized.
using System;
class GFG{
static int findMinDif(int []arr, int N)
{
// Sort the array
Array.Sort(arr);
// Return the difference between
// two highest elements
return (arr[N - 1] - arr[N - 2]);
}
// Driver code
public static void Main()
{
int []arr = { 7, 9, 5, 10 };
int N = arr.Length;
Console.Write(findMinDif(arr, N));
}
}
// This code is contributed by Code_Mech
<script>
// javascript Program to split a given array
// such that the difference between
// their maximums is minimized.
function findMinDif(arr , N) {
// Sort the array
arr.sort((a,b)=>a-b);
// Return the difference between
// two highest elements
return (arr[N - 1] - arr[N - 2]);
}
// Driver code
var arr = [ 7, 9, 5, 10 ];
var N = arr.length;
document.write(findMinDif(arr, N));
// This code contributed by gauravrajput1
</script>
Time complexity: O(N*log(N)), N is the number of elements of the array.
Auxiliary Space: O(1)
Another Approach: We can optimize the above code by removing the sort function used above. As the answer is basically the difference between the two greatest elements of the array, so we can traverse the array and can find two greatest elements in O(n) time.
Below is the code for the given approach:
C++
// C++ Program to split a given
// array such that the difference
// between their maximums is minimized.
#include <bits/stdc++.h>
using namespace std;
int findMinDif(int arr[], int n)
{
int first_max = INT_MIN;
int second_max = INT_MIN;
for (int i = 0; i < n ; i ++)
{
// If current element is greater than first
// then update both first and second
if (arr[i] > first_max)
{
second_max = first_max;
first_max = arr[i];
}
// If arr[i] is less and equal to first_max
// but greater than second_max
// then update the second_max
else if (arr[i] > second_max)
second_max = arr[i];
}
// Return the difference
// between two highest
// elements
return first_max-second_max;
}
// Driver code
int main()
{
int arr[] = { 7, 9, 5, 10 };
int n = sizeof(arr) / sizeof(arr[0]);
cout << findMinDif(arr, n) << endl;
return 0;
}
// This code is contributed by Pushpesh Raj
/*package whatever //do not write package name here */
import java.io.*;
import java.util.*;
class GFG {
public static int findMinDif(int[] arr, int n)
{
int first_max = Integer.MIN_VALUE;
int second_max = Integer.MIN_VALUE;
for (int i = 0; i < n; i++)
{
// If current element is greater than first
// then update both first and second
if (arr[i] > first_max) {
second_max = first_max;
first_max = arr[i];
}
// If arr[i] is less and equal to first_max
// but greater than second_max
// then update the second_max
else if (arr[i] > second_max)
second_max = arr[i];
}
// Return the difference
// between two highest
// elements
return first_max - second_max;
}
public static void main(String[] args)
{
int[] arr = { 7, 9, 5, 10 };
int n = arr.length;
System.out.println(findMinDif(arr, n));
}
}
// This code is contributed by akashish__
def findMinDif(arr, n):
first_max = -2147483647
second_max = -2147483647
#for (int i = 0; i < n ; i ++)
for i in range(0,n):
# If current element is greater than first
# then update both first and second
if (arr[i] > first_max):
second_max = first_max
first_max = arr[i]
# If arr[i] is less and equal to first_max
# but greater than second_max
# then update the second_max
elif (arr[i] > second_max):
second_max = arr[i]
# Return the difference
# between two highest
# elements
return first_max-second_max
# Driver code
arr = [7, 9, 5, 10 ]
n = len(arr)
print(findMinDif(arr, n))
# This code is contributed by akashish__
using System;
public class GFG {
public static int findMinDif(int[] arr, int n)
{
int first_max = Int32.MinValue;
int second_max = Int32.MinValue;
for (int i = 0; i < n; i++)
{
// If current element is greater than first
// then update both first and second
if (arr[i] > first_max) {
second_max = first_max;
first_max = arr[i];
}
// If arr[i] is less and equal to first_max
// but greater than second_max
// then update the second_max
else if (arr[i] > second_max)
second_max = arr[i];
}
// Return the difference
// between two highest
// elements
return first_max - second_max;
}
static public void Main()
{
int[] arr = { 7, 9, 5, 10 };
int n = arr.Length;
Console.WriteLine(findMinDif(arr, n));
}
}
// This code is contributed by akashish__
<script>
// Javascript Program to split a given
// array such that the difference
// between their maximums is minimized.
function findMinDif(arr,n)
{
let first_max = Number.MIN_VALUE;
let second_max = Number.MIN_VALUE;
for (let i = 0; i < n ; i ++)
{
// If current element is greater than first
// then update both first and second
if (arr[i] > first_max)
{
second_max = first_max;
first_max = arr[i];
}
// If arr[i] is less and equal to first_max
// but greater than second_max
// then update the second_max
else if (arr[i] > second_max)
second_max = arr[i];
}
// Return the difference
// between two highest
// elements
return first_max-second_max;
}
// Driver code
let arr =[ 7, 9, 5, 10 ];
let n = arr.length;
console.log(findMinDif(arr, n));
// This code is contributed by akashish__
</script>
Time Complexity: O(n)
Auxiliary Space: O(1)
Related Topic: Subarrays, Subsequences, and Subsets in Array
Similar Reads
Split array into two subarrays such that difference of their sum is minimum Given an integer array arr[], the task is to split the given array into two subarrays such that the difference between their sum is minimum. Examples: Input: arr[] = {7, 9, 5, 10}Output: 1Explanation: The difference between the sum of the subarrays {7, 9} and {5, 10} is equal to [16 – 15] = 1, which
10 min read
Split array into subarrays such that sum of difference between their maximums and minimums is maximum Given an array arr[] consisting of N integers, the task is to split the array into subarrays such that the sum of the difference between the maximum and minimum elements for all the subarrays is maximum. Examples : Input: arr[] = {8, 1, 7, 9, 2}Output: 14Explanation:Consider splitting the given arra
6 min read
Split array into K Subarrays to minimize sum of difference between min and max Given a sorted array arr[] of size N and integer K, the task is to split the array into K non-empty subarrays such that the sum of the difference between the maximum element and the minimum element of each subarray is minimized. Note: Every element of the array must be included in one subarray and e
6 min read
Split a given array into K subarrays minimizing the difference between their maximum and minimum Given a sorted array arr[] of N integers and an integer K, the task is to split the array into K subarrays such that the sum of the difference of maximum and minimum element of each subarray is minimized. Examples: Input: arr[] = {1, 3, 3, 7}, K = 4 Output: 0 Explanation: The given array can be spli
6 min read
Split given arrays into subarrays to maximize the sum of maximum and minimum in each subarrays Given an array arr[] consisting of N integers, the task is to maximize the sum of the difference of the maximum and minimum in each subarrays by splitting the given array into non-overlapping subarrays. Examples: Input: arr[] = {8, 1, 7, 9, 2}Output: 14Explanation:Split the given array arr[] as {8,
6 min read