Cp---dsa/31.cpp at master · Pushpendra100/Cp---dsa · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#include <bits/stdc++.h>
using namespace std;
// BALANCED BRACKETS MATCHING

/*
    ((())) -> balanced
    ((()  -> unbalanced
    [[()]](() -> unbalanced
*/

unordered_map<char,int> symbols = {
    {'[', -1},
    {'{', -2},
    {'(', -3},
    {']', 1},
    {'}', 2},
    {')', 3},
};

string isBalanced(string s){
    stack<char> st;
    for (char &bracket : s)
    {
        if(symbols[bracket]<0){
            //opening bracket
            st.push(bracket);

        }else{
            //closing bracket
            if(st.empty()) return "NO";
            char top = st.top();
            st.pop();
            if(symbols[top]+ symbols[bracket] != 0){
                return "NO";
            }
        }
    }
    if(st.empty()) return "YES";
    return "NO";
}


int main() {

    // we will put opeing brackets in the stack and check the stack for the opening bracket for the closing bracket

    /*
    input
    3
    {[()]}
    {[(])}
    {{[[(())]]}}
    */


    int t;
    cin>>t;
    while (t--)
    {
        string s;
        cin>>s;
        cout<<isBalanced(s)<<"\n";
    }


    return 0;
}