Algorithms and Data Structures

  • Profound Academy

    • Status
      • 1
        Implementation
      • 2
        Bitwise operations
      • 3
        Prefix Sums
      • 4
        Sliding window / Two pointers
      • 5
        Modular Arithmetic
      • 6
        Number Theory
      • 7
        Binary Search
      • 8
        Basic Sorting
      • 9
        Greedy Algorithms
      • 10
        Basic Dynamic Programming
      • 11
        Recursion
      • 12
        Linked LIst
      • 13
        Queue & Stack
      • 14
        Binary tree + BST
      • 15
        Divide & Conquer + Advanced Sorting
      • 16
        Heap
      • 17
        Hashing
      • 18
        Graph Representation
      • 19
        BFS

    • Find the longest valid bracket sequence

    The C++ programming language uses curly braces { and } to separate scopes. You’re trying to parse a C++ code and would like to make sure it’s syntactically correct. The first step is to make sure the opening curly braces match the closing ones.
    You’ve decided to write a program that given a list of curly braces would print the longest sequence of curly braces starting from the very beginning that’s valid.

    Input

    The only line of the input contains a string b (1 ≤ |b| ≤ ) containing curly braces.

    Output

    The program should print the length of the longest sequence of curly braces that’s valid and starts from the beginning.

    Examples

    Input
    Output
    {{}}
    4
    {{{}
    0
    }{{}
    0
    {}{{{{}
    2
     

    Constraints

    Time limit: 1 seconds

    Memory limit: 512 MB

    Output limit: 1 MB

    To check your solution you need to sign in
    Sign in to continue