Problem 2842 · Hard

Count K-Subsequences of a String With Maximum Beauty

Difficulty not yet verified.

Open the interactive visualisation