Longest Span with same Sum in two Binary arrays | A Simple Javascript program to find longest common subarray of two binary arrays with same sum ; Returns length of the longest common sum in arr1 [ ] and arr2 [ ] . Both are of same size n . ; Initialize result ; One by one pick all possible starting points of subarrays ; Initialize sums of current subarrays ; Conider all points for starting with arr [ i ] ; Update sums ; If sums are same and current length is more than maxLen , update maxLen ; Driver Code
let arr1 = [ 0 , 1 , 0 , 1 , 1 , 1 , 1 ] ; let arr2 = [ 1 , 1 , 1 , 1 , 1 , 0 , 1 ] ; function longestCommonSum ( n ) { let maxLen = 0 ; for ( let i = 0 ; i < n ; i ++ ) { let sum1 = 0 , sum2 = 0 ; for ( let j = i ; j < n ; j ++ ) { sum1 += arr1 [ j ] ; sum2 += arr2 [ j ] ; if ( sum1 == sum2 ) { let len = j - i + 1 ; if ( len > maxLen ) maxLen = len ; } } } return maxLen ; } document . write ( " " + " " ) ; document . write ( longestCommonSum ( arr1 . length ) ) ;