https://leetcode.com/problems/valid-parentheses/

valid-parentheses.cpp

#include <string>
#include <vector>
using namespace std;

class Solution {
public:
    bool isValid(string s)
    {
        vector<char> queue;
        for (auto c : s)
        {
            switch (c)
            {
            case '(':
            case '[':
            case '{':
                queue.emplace_back(c);
                break;
            case ')':
                if (queue.empty() || queue.back() != '(') return false;
                queue.pop_back();
                break;
            case ']':
                if (queue.empty() || queue.back() != '[') return false;
                queue.pop_back();
                break;
            case '}':
                if (queue.empty() || queue.back() != '{') return false;
                queue.pop_back();
                break;
            default:
                return false;
            }
        }
        if (!queue.empty()) return false;
        return true;
    }
};
int main()
{
    Solution s;
    auto o = s.isValid({"([])"});
    return 0;
}

Runtime: 4 ms, faster than 100.00% of C++ online submissions for Valid Parentheses.
Memory Usage: 8.5 MB, less than 99.75% of C++ online submissions for Valid Parentheses.