Hive.ai·Software Engineer·Technical Phone Screen
Mar 2026
Interviewed for a software engineer role at Hive.ai and got a grid-based BFS problem. Pretty standard algorithmic round, nothing too wild, but the problem had a subtle twist that I didn't fully nail on the first pass.
- Given an n x n grid of 0s and 1s where 1 is land and 0 is water, find the water cell whose distance to the nearest land cell is the greatest. Return that maximum distance using Manhattan distance, or -1 if there's no land or no water.
“I started thinking single-source BFS from each water cell and immediately realized that would be way too slow.” The rest of the author's notes on Software Engineer interview at Hive.ai, Technical Phone Screen round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.
View Post