Validate Google C++ Brackets | Dataford Interview Questions

In a Google code review for embedded firmware, a common low-level correctness check is verifying that delimiters are balanced before deeper parsing. Write a function that determines whether a source string has valid and properly nested brackets.

A string is valid if every opening bracket has a matching closing bracket of the same type, and brackets close in the correct order. Consider only these bracket characters: (), [], and {}. Ignore all other characters.

Formal Specification

Input: a string code
Output: True if the brackets in code are balanced and properly nested; otherwise False

Constraints

0 <= len(code) <= 10^5
code may contain any printable ASCII characters
Only the characters '(', ')', '[', ']', '{', '}' affect the result
The expected solution should run in O(n) time

Function Signature

def is_valid_brackets(code):

Your question is Validate Google C++ Brackets. 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

Formal Specification

Input: a string code
Output: True if the brackets in code are balanced and properly nested; otherwise False

Constraints

0 <= len(code) <= 10^5
code may contain any printable ASCII characters
Only the characters '(', ')', '[', ']', '{', '}' affect the result
The expected solution should run in O(n) time

Function Signature

def is_valid_brackets(code):

Your question is Validate Google C++ Brackets. 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.