Function to find minimum possible sum of pair which breaks the array into 3 non - empty subarrays
static int minSumPair ( int [ ] arr , int N ) { if ( N < 5 ) { return - 1 ; } int [ ] prefixMin = new int [ N ] ; prefixMin [ 0 ] = arr [ 0 ] ;