Class Solution

  • All Implemented Interfaces:

    
    public final class Solution
    
                        

    3703 - Remove K-Balanced Substrings.

    Medium

    You are given a string s consisting of '(' and ')', and an integer k.

    A string is k-balanced if it is exactly k consecutive '(' followed by k consecutive ')', i.e., '(' * k + ')' * k.

    For example, if k = 3, k-balanced is "((()))".

    You must repeatedly remove all non-overlapping k-balanced substring from s, and then join the remaining parts. Continue this process until no k-balanced substring exists.

    Return the final string after all possible removals.

    Example 1:

    Input: s = "(())", k = 1

    Output: ""

    Explanation:

    k-balanced substring is "()"

    Thus, the final string is "".

    Example 2:

    Input: s = "(()(", k = 1

    Output: "(("

    Explanation:

    k-balanced substring is "()"

    Thus, the final string is "((".

    Example 3:

    Input: s = "((()))()()()", k = 3

    Output: "()()()"

    Explanation:

    k-balanced substring is "((()))"

    Thus, the final string is "()()()".

    Constraints:

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

    • s consists only of '(' and ')'.

    • 1 &lt;= k &lt;= s.length / 2

    • 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 removeSubstring(String s, Integer k)
      • Methods inherited from class java.lang.Object

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