Returns subarray with sum closest to 0.
function findSubArray ( arr , n ) { let start = - 1 , end = - 1 , min_diff = Number . MAX_VALUE ; let pre_sum = new Array ( n + 1 ) ; for ( let i = 0 ; i < n + 1 ; i ++ ) pre_sum [ i ] = new Prefix ( ) ;