Here’s a classic interview question, reframed as a code golf challenge.Write a function that checks whether parentheses, square brackets, and curly brackets are properly balanced. It must correctly handle nested cases, mismatches, and unfinished input. A compact Python solution comes in at 201 characters using a stack. Can you beat that character count? Share your shortest solution!

Subscribe to Google for Developers → https://goo.gle/developers 

Speakers: Christine Rafla

Google for Developers

A code golf challenge to write the shortest readable bracket/parenthesis validator function, benchmarked against a 201-character Python stack-based solution. Open to any language, with a bonus question about which language has the cleanest stack or array manipulation for this problem.

Can you beat Python's character count while staying readable? Go!