For a given string S, write a program based on dynamic programming for finding the length of

the longest substring of S which contains exactly K distinct vowels.

Input: s = “artyebui”, k = 2

Output: 6

Explanation: Longest substring with only 2 vowel is “rtyebu”

Can somebody provide me a DP approach to it?