Dsa
Hashing
Easy
Balanced Parentheses
Write a program that checks if a given string of parentheses is balanced. The string may contain '(' and ')' only.
Input:
- A single string (1 ≤ |s| ≤ 1000) containing only '(' and ')'.
Output:
- 'YES' if the parentheses are balanced, otherwise 'NO'.
Example:
Input:
(()())
Output:
YES
Key concepts
hashingstacksvalidation
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