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.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1106. Parsing A Boolean Expression

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact