Xuanken Tay

Software engineer who likes statistics, machine learning, DevOps and the cloud

less than 1 minute read

Given a string s containing round, curly, and square open and closing brackets, return whether the brackets are balanced.

Constraints

  • n ≤ 100,000 where n is the length of s

https://binarysearch.com/problems/Balanced-Brackets-Sequel

Examples

Example 1

Input

  • s = [(])

Output

  • answer = False

Example 2

Input

  • s = ([])[]({})

Output

  • answer = True

Solution

Leave a comment

Read more

Repeated Deletion Sequel

less than 1 minute read

Given a string s and an integer k, repeatedly delete the earliest k consecutive duplicate characters.

Balanced Brackets

less than 1 minute read

You’re given a string s consisting solely of "(" and ")". Return whether the parentheses are balanced.

Minimum Bracket Addition

less than 1 minute read

Given a string s containing brackets ( and ), return the minimum number of brackets that can be inserted so that the brackets are balanced.