Extend an Expense Rules Engine with Nested Boolean Conditions
Company: Rippling
Role: Software Engineer
Category: Software Engineering Fundamentals
Difficulty: hard
Interview Round: Technical Screen
Overview: Extend an expense rules engine with validated AND/OR/NOT expression trees, typed leaf operators, explicit missing-field semantics, and explainable evaluation.
Read the full Rippling Software Engineer interview experience this question came from