If current index is odd , then add it to odd sum and recurse
if ( index % 2 != 0 ) { for ( let i = 0 ; i <= 9 ; i ++ ) { out [ index ] = String . fromCharCode ( i + ' ' . charCodeAt ( 0 ) ) ; findNDigitNumsUtil ( n , out , index + 1 , evenSum , oddSum + i ) ; } }