Basic Dp problem

insert minimum number of character in a given string after which the resulting string contain a subsequence abcdefgh...xyz

knapsack dp with ntt