Bracket Validation With Stack | Dataford Interview Questions

Availity Essentials may represent claim validation rules as text containing nested grouping symbols. Given a string, determine whether all bracket characters are correctly matched and properly nested.

The input may contain parentheses (), square brackets [], and curly braces {}. Characters that are not brackets should be ignored. A string is valid when every opening bracket has the correct closing bracket, brackets close in last-in, first-out order, and no unmatched brackets remain.

Implement valid_brackets(s) and return True for valid input or False otherwise.

Formal Specification

Input: s, a string with length n, containing printable characters.
Output: A Boolean indicating whether the bracket sequence is valid.
Only (), [], and {} affect validity. All other characters are ignored.

Constraints

0 <= len(s) <= 10^5
s contains ASCII printable characters
Only (), [], and {} affect validity
Non-bracket characters must be ignored

Function Signature

def valid_brackets(s):

Your question is Bracket Validation With Stack. 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