You are viewing a single comment's thread. Return to all comments →
C++ Solution
string isBalanced(string s) { stack<char> brackets{}; map<char, char> pairs = { {')', '('}, {'}', '{'}, {']', '['}, }; for(auto& ch: s){ if(pairs.find(ch) == pairs.end()){ brackets.push(ch); }else{ if(!brackets.empty() && brackets.top() == pairs[ch]){ brackets.pop(); }else{ return "NO"; } } } if(brackets.size()) return "NO"; else return "YES"; }
Balanced Brackets
You are viewing a single comment's thread. Return to all comments →
C++ Solution