Retired
Check for Balanced Brackets (retired)
Description:
Given an expression string exp, write a program to examine
whether the pairs and the orders of
“{“, “}”, “(“, “)”, “[“, “]” , “<“, “>”
are correct in exp.
Example:
Input: exp = “[()]{}{[()()]()}”
Output: true
Input: exp = “[(])”
Output: false
Algorithms
Similar Kata:
Stats:
| Created | Oct 20, 2021 |
| Warriors Trained | 86 |
| Total Skips | 0 |
| Total Code Submissions | 100 |
| Total Times Completed | 12 |
| JavaScript Completions | 12 |
| Total Stars | 0 |
| % of votes with a positive feedback rating | 5% of 10 |
| Total "Very Satisfied" Votes | 0 |
| Total "Somewhat Satisfied" Votes | 1 |
| Total "Not Satisfied" Votes | 9 |
| Total Rank Assessments | 10 |
| Average Assessed Rank | 6 kyu |
| Highest Assessed Rank | 6 kyu |
| Lowest Assessed Rank | 8 kyu |
