You are given a string s and an integer repeatLimit. Construct a new string using characters from s such that no character appears more than repeatLimit times consecutively. You do not need to use all the characters from s.

Return the lexicographically largest string that can be formed under this condition.

A string a is lexicographically larger than a string b if, at the first position where they differ, string a has a letter that appears later in the alphabet than the corresponding letter in b, or if b is a prefix of a and a is longer.

Constraints:

• $1 \leq$ repeatLimit $\leq$ s.length $\leq 10^5$

• s consists of lowercase English letters.

Input: s = "zzzyyxa"-str, repeatLimit = 2-int
Output: "zzyzyxa"-str
Explanation: Use at most two consecutive z characters, inserting y between groups of z to form the lexicographically largest valid string, zzyzyxa.

Input: s = "aaaaab"-str, repeatLimit = 1-int
Output: "ba"-str
Explanation: Since only one identical character can appear consecutively, place b first and use one a, producing the lexicographically largest valid string, ba.

Input: s = "r"-str, repeatLimit = 1-int
Output: "r"-str
Explanation: The single character r does not exceed the repeat limit, so the result is r.

Input: s = "kkkkk"-str, repeatLimit = 3-int
Output: "kkk"-str
Explanation: At most three k characters can appear consecutively, so the lexicographically largest valid string is kkk.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.