Palo·Software Engineer·Onsite - Coding / Algorithms
Jul 2026
Went through a coding round at Palo for a software engineer role. Three questions, all algorithmic, ranging from pretty standard to genuinely tricky. The expression evaluator one took me longer than I'd like to admit.
- Given a sorted array of integers and a target value, find the index of the target. Return -1 if it's not there. Expected O(log n) time.
- Design a data structure that supports insert, remove, and getRandom, all in average O(1) time.
- Evaluate a math expression given as a string with +, -, *, / operators and non-negative integers. Operator precedence applies. Follow-up: support parentheses.
“Classic binary search, nothing to say really.” The rest of the author's notes on Software Engineer interview at Palo, Onsite - Coding / Algorithms round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.
View Post