Java implementation to find the maximum product of the digit sum of the consecutive pairs of the subsequence of the length K
import java . util . * ; class GFG { static int MAX = 100 ; static int dp [ ] [ ] [ ] = new int [ 1000 ] [ MAX ] [ MAX ] ;