Kickoff·Software Engineer·Technical Phone Screen
Jul 2026
Kickoff had me implement a full truth table generator from a string boolean expression, which sounds manageable until you realize they want parsing, precedence handling, variable extraction, and complexity analysis all in one shot. Pretty dense technical screen for a software engineer role.
- Implement a function that takes a string boolean expression and outputs a complete truth table. Variables are single uppercase letters, operators include '!' for NOT, adjacency for implicit AND, and '+' for OR, with parentheses allowed and spaces ignored. You need to parse the expression, extract and sort all distinct variables, enumerate all 2^n assignments, and print the truth table rows.
- Describe your parsing approach for this expression language and discuss edge cases like unmatched parentheses, unknown symbols, or empty input.
“The implicit AND part is what tripped me up first.”