Count K-Subsequences of a String With Maximum Beauty - DSA Problem | Talentd