Quick Overview

Evaluate a JSON-compatible Boolean formula AST containing Boolean and integer literals, AND, OR, and relational operators. Apply the specified numeric coercions and short-circuit rules, avoid recursion limits on skewed trees, and always return a primitive Boolean.

Evaluate a Boolean Formula AST

Company: Sigmacomputing

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Overview: Evaluate a JSON-compatible Boolean formula AST containing Boolean and integer literals, AND, OR, and relational operators. Apply the specified numeric coercions and short-circuit rules, avoid recursion limits on skewed trees, and always return a primitive Boolean.

Loading…