Leetcode 1106. Parsing A Boolean Expression
Parse and evaluate a fully parenthesized boolean expression string made of literals 't'/'f', unary '!' and comma-separated n-ary '&' and '|' operators with arbitrary nesting, returning the final boolean result.
Asked at:
Microsoft
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Late July, 2026
Mid-level
parse a list of circuit expression and return a list of integer outputs.
Hello Interview Premium
Your account is free and you can post anonymously if you choose.