If current index is odd , then add it to odd sum and recurse
if ( index & 1 ) { for ( int i = 0 ; i <= 9 ; i ++ ) { out [ index ] = i + '0' ; findNDigitNumsUtil ( n , out , index + 1 , evenSum , oddSum + i ) ; } }