Javascript implementation to find the maximum product of the digit sum of the consecutive pairs of the subsequence of the length K
const MAX = 100 ; let dp = [ ] for ( let i = 0 ; i < 1000 ; i ++ ) { let temp1 = [ ] ; for ( let j = 0 ; j < MAX ; j ++ ) { let temp2 = [ ] ; for ( let k = 0 ; k < MAX ; k ++ ) { temp2 . push ( 0 ) } temp1 . push ( temp2 ) } dp . push ( temp1 ) }