Search
⌘K
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.