Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Evaluate Boolean Expression
Coding
- Asked to complete a 3-part coding test in under 60 minutes. mostly basic stuff like data parsing, but a lot of small conditions make it difficult to complete in 60 minutes.
Coding
- Build Binary Expression Tree From Infix Expression
Coding
- Check If Two Expression Trees are Equivalent
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Microsoft
Leetcode 1106. Parsing A Boolean Expression
Reported Jul 28, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source