Walmart·Backend Engineer·Technical Phone Screen
Jun 2026
Walmart Labs backend round, pretty much a straight algorithms session. One problem, two approaches to explain, then complexity and testing questions at the end. Not a bad experience but the follow-up on testing felt a bit rushed.
- Given an array of meeting time intervals, find the minimum number of conference rooms needed to hold all meetings without overlap.
- What is the time complexity of your solution, and how would you test it?
“I went straight for the min-heap approach: sort by start time, push end times into the heap, and pop whenever the next meeting starts after the earliest ending one.”