# BALANCED-BRACKETS hackerrank Solution - Correct, Optimal and Working

``````/*
*  Author: Arpit Bhayani
*  https://arpitbhayani.me
*/
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <deque>
#include <iostream>
#include <list>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>

#define ll long long

#define MIN(a, b) a < b ? a : b
#define MAX(a, b) a > b ? a : b

using namespace std;

int i = 0;
char ch;
while((ch = getchar()) != '\n') {
str[i++] = ch;
}
str[i] = '\0';
return i;
}

char compliment(char s) {
if(s == '(') return ')';
if(s == '{') return '}';
if(s == '[') return ']';
return 0;
}

int process(char * str) {
stack<char> s;
for(int i = 0; str[i]; i++) {
if(str[i] == '{' || str[i] == '(' || str[i] == '[') {
s.push(compliment(str[i]));
}
else {
if(s.empty()) {
return 0;
}
char t = s.top();
s.pop();

if(t != str[i]) {
return 0;
}
}
}
return s.empty() ? 1: 0;
}

int main(int argc, char *argv[]) {
int t;
char str[1024];
char output[2][16] = {"NO", "YES"};

scanf("%d", &t);
while(t--) {
scanf("%s", str);
printf("%s\n", output[process(str)]);
}

return 0;
}
``````