We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Strings
  4. Super Reduced String
  5. Discussions

Super Reduced String

  • geovanni_luna
     + 0 comments

    here is a python solution with O(n) time and O(n) space in worse case; however, if the stack ends up being empty the space will be O(1)

    def superReducedString(s):
    stack = []
    
    for c in s:
        if not stack or stack[-1] != c:
            stack.append(c)
        else:
            stack.pop()
    
    if not stack:
        return "Empty String"
        
    return "".join(stack)