Retired
Braces status (retired)
53 of 547bestwebua
Description:
Write a function that checks the braces status in a string, and return True
if all braces are properly closed, or False
otherwise. Available types of brackets: ()
, []
, {}
.
Please note, you need to write this function without using regex!
Examples
'([[some](){text}here]...)' => true
'{([])}' => true
'()[]{}()' => true
'(...[]...{(..())}[abc]())' => true
'1239(df){' => false
'[()])' => false
')12[x]34(' => false
Don't forget to rate this kata! Thanks :)
Algorithms
Fundamentals
Logic
Arrays
Data Types
Loops
Control Flow
Basic Language Features
Regular Expressions
Declarative Programming
Advanced Language Features
Programming Paradigms
Strings
Similar Kata:
Stats:
Created | Feb 6, 2017 |
Warriors Trained | 1272 |
Total Skips | 70 |
Total Code Submissions | 2843 |
Total Times Completed | 547 |
Ruby Completions | 53 |
JavaScript Completions | 259 |
Python Completions | 256 |
Crystal Completions | 3 |
Total Stars | 26 |
% of votes with a positive feedback rating | 87% of 218 |
Total "Very Satisfied" Votes | 180 |
Total "Somewhat Satisfied" Votes | 20 |
Total "Not Satisfied" Votes | 18 |
Total Rank Assessments | 72 |
Average Assessed Rank | 6 kyu |
Highest Assessed Rank | 4 kyu |
Lowest Assessed Rank | 8 kyu |