If length is odd , it means we need second element of this current pair , calculate the product of digit sum of current and previous element and recur by moving towards next index
inc = ( productDigitSum ( arr [ prev ] , arr [ i ] ) + solve ( arr , i + 1 , len + 1 , i , n , k ) ) NEW_LINE else : NEW_LINE