Valid Parentheses using Stack

Medium STL Containers

Solve in Playground →

Problem Statement

Write a C++ program using `std::stack` to validate matching brackets/parentheses in an expression string.

Input Format

A single word bracket string S.

Output Format

Print 'Balanced' or 'Not Balanced'.

Constraints

1 <= Length <= 100

Sample Input

{[()]}

Sample Output

Balanced

Explanation

Stacks are ideal for tracking nested bracket scopes and checking matching pairs.

Starter Code

#include <iostream>
#include <stack>
#include <string>

bool isValid(std::string s) {
    // Implement bracket validation logic using std::stack here
    return true;
}

int main() {
    std::string s;
    if (std::cin >> s) {
        if (isValid(s)) std::cout << "Balancedn";
        else std::cout << "Not Balancedn";
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →