View data-structures-and-algorithms on GitHub

Data Structures and Algorithms

Language: Python

Challenge Type: ` Code Challenge / Algorithm`

stack-queue-brackets

Code

tests

Challenge13

Create a function that takes in a string and returns true or false depending on whether or not the brackets (‘{}’, ‘[]’, ‘()’) are balanced.

Whiteboard Process

WhiteBoard

Approach & Efficiency

Using a stack, I iterate through the string. The opening brackets are pushed onto the stack and then when a closing bracket is found, the corresponding opening bracket is popped out from the stack for comparing If the stacks ends up being empty at the end, return true.

  • I try to keep it simple by using one for loop so we end with complexity as the following:
    1. Space: O(N)
    2. Time: O(N)