Package g1201_1300.s1209_remove_all_adjacent_duplicates_in_string_ii

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1209 - Remove All Adjacent Duplicates in String II.

    Medium

    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:

    Input: s = "abcd", k = 2

    Output: "abcd"

    Explanation: There's nothing to delete.

    Example 2:

    Input: s = "deeedbbcccbdaa", k = 3

    Output: "aa"

    Explanation:

    First delete "eee" and "ccc", get "ddbbbdaa"

    Then delete "bbb", get "dddaa"

    Finally delete "ddd", get "aa"

    Example 3:

    Input: s = "pbbcggttciiippooaais", k = 2

    Output: "ps"

    Constraints:

    • <code>1 <= s.length <= 10<sup>5</sup></code>

    • <code>2 <= k <= 10<sup>4</sup></code>

    • s only contains lower case English letters.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final String removeDuplicates(String s, Integer k)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait