Dsa
Stack
Medium
Balanced Bracket Sequence
Given a string consisting of brackets '(', ')', '{', '}', '[' and ']', determine if the input string has balanced brackets. A string is balanced if every opening bracket has a corresponding closing bracket and the brackets are properly nested.
Input Format:
A single line string containing brackets only.
Output Format:
Print 'Balanced' if the brackets are balanced, otherwise print 'Not Balanced'.
Example:
Input:
{[()]}
Output:
Balanced
Key concepts
stackstringvalidation
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now