Given the input inStr, give the boolean output out indicating whether all the parentheses are balanced.
Examples:
- If inStr is '(()', the output is false.
- If inStr is '(xyz)(ab)' the output is true.
- If inStr is ')(', the output is false.
The string may include characters other than ( and ), but you should ignore them.
Incidentally, this problem was inspired from the Rosetta Code site. Why not create a few problems of your own by poking around the tasks at Rosetta Code?
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers1249
Suggested Problems
-
4505 Solvers
-
How long is the longest prime diagonal?
412 Solvers
-
1683 Solvers
-
610 Solvers
-
Number of Even Elements in Fibonacci Sequence
1680 Solvers
More from this Author96
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
can be solved without 'regexp'