← Back to Directory

Flexport

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

Flexport·Software Engineer·Technical Phone Screen

May 2026
Flexport SWE interview that went sideways in a kind of funny way. Got asked to implement House Robber with both greedy and DP, and the whole session turned into a debate about whose answer was actually correct.
  • 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.”

View Post

Flexport·Software Engineer·Technical Phone Screen

May 2026
Flexport software engineer screen with a logistics-themed coding problem. Pretty low-stakes as far as coding rounds go, felt more like a warmup to check if you can write clean linear-time code than anything else.
  • Given a list of items each with a weight and an optional id, implement a function that simulates loading all of them onto a ship with no capacity limit. Return the load order, total weight, and item count.

“Straightforward O(n) pass through the list, nothing gets rejected so you're basically just accumulating.”

View Post

Flexport·Software Engineer·Technical Phone Screen

Apr 2026
Flexport SWE interview with a logistics-flavored coding problem. Pretty domain-specific but the underlying algorithm is straightforward once you see it.
  • Given a list of items with weights and a per-ship capacity C, assign items to ships in order: add each item to the current ship if it fits, otherwise start a new ship. If a single item exceeds C, reject it. Return the list of ships with their loaded item IDs, and a separate list of rejected item IDs. Solve in O(n) time.

“The greedy part clicked pretty fast since you're just processing left to right and never backtrack.”

View Post

Flexport·Software Engineer·Technical Phone Screen

Apr 2026
First-round technical screen at Flexport for a software engineer role. The coding problems had reference answer errors, the test setup ate up way too much time, and a rejection came through 30 minutes after the call ended. First-round rejections here carry a 6-month freeze, so that stings extra.
  • House Robber III (LeetCode 337): given a binary tree where each node has a value, find the maximum amount you can collect such that you never rob two directly connected nodes.

“The problem itself is fine, tree DP, nothing shocking.”

View Post