2842. Count K-Subsequences of a String With Maximum Beauty ========================================================== :题号: 2842 :题名: Count K-Subsequences of a String With Maximum Beauty :类型: Algorithms(元数据占位) :难度: Hard :原题: `LeetCode 2842 `_ :数据源: LeetCode GraphQL :处理状态: 题目文件已建立;题目信息、题目重述与自建示例待下一轮补充。