1209. Remove All Adjacent Duplicates in String II
https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii
Description
You are given a string s
and an integer k
, a k
duplicate removal consists of choosing k
adjacent and equal letters from s
and removing them, causing the left and the right side of the deleted substring to concatenate together.
We repeatedly make k
duplicate removals on s
until we no longer can.
Return the final string after all such duplicate removals have been made. It is guaranteed that the answer is unique.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= s.length <= 105
2 <= k <= 104
s
only contains lower case English letters.
ac
Previous1208. Get Equal Substrings Within BudgetNext1210. Minimum Moves to Reach Target with Rotations
Last updated