Skip to interview prep
Apexed

375. Given a boolean expression of T and F symbols separated by &, | and ^, count the parenthesisations that evaluate to true.

HardDynamic programming

Technical

Write a solution in JavaScript or Python, add a few test calls that print results and press Run. This is ungraded practice: Run shows output and does not check correctness. Open the Model answer tab to compare. Your code is saved in this browser.

Tab indents · Ctrl/⌘ + Enter runs · Esc then Tab leaves the editor

Press Run to see your program’s output.

Given a boolean expression of T and F symbols separated by &, | and ^, count the parenthesisations that evaluate to true. — Data structures & algorithms intervi