Balanced Bracket Sequence | Dataford Interview Questions

Given a bracket sequence, check whether it is valid and balanced using stack logic.

Implement is_valid_brackets(sequence), where sequence is a string containing only (, ), [, ], {, and }. Return True if every opening bracket is closed by the correct bracket in the correct order, otherwise return False. An empty sequence is valid.

Constraints

0 <= len(sequence) <= 10^4
sequence contains only the six bracket characters (, ), [, ], {, and }
The function returns a boolean

Function Signature

def is_valid_brackets(sequence):

Your question is Balanced Bracket Sequence. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Given a bracket sequence, check whether it is valid and balanced using stack logic.

Constraints

0 <= len(sequence) <= 10^4
sequence contains only the six bracket characters (, ), [, ], {, and }
The function returns a boolean

Function Signature

def is_valid_brackets(sequence):

Your question is Balanced Bracket Sequence. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.