Flexport·Software Engineer·Technical Phone Screen
- Solve the House Robber problem (LeetCode 198) using both a greedy approach and dynamic programming.
“So I wrote greedy first because I thought I was being thorough by showing multiple approaches.”
Mid-sized
Screna has 4 Flexport interview write-ups. The most reported round is the technical phone screen (4).
4 interview notes · updated Jun 2026
“So I wrote greedy first because I thought I was being thorough by showing multiple approaches.”
“Straightforward O(n) pass through the list, nothing gets rejected so you're basically just accumulating.”
“The greedy part clicked pretty fast since you're just processing left to right and never backtrack.”
“The problem itself is fine, tree DP, nothing shocking.”