← Back to Directory

Hive.ai

Small

Screna has 3 Hive.ai interview write-ups. The most reported round is the technical phone screen (3).

3 interview notes · updated Jun 2026

Hive.ai·Software Engineer·Technical Phone Screen

May 2026
Coding round at Hive.ai for a software engineer role, one algorithmic problem, nothing too wild but it took me a minute to land on the clean approach.
  • Given an array of integers, sort it using only pancake flips, where a flip reverses the subarray from index 0 to some chosen index k. Return the sequence of k values used.

“I knew the general idea of pancake sorting but blanked on how to structure it cleanly under pressure.”

View Post

Hive.ai·Software Engineer·Technical Phone Screen

Apr 2026
Coding round at Hive.ai for a software engineer position. One algorithmic problem, grid-based BFS stuff. Nothing too wild but the constraints made it more interesting than it first looked.
  • Given an n×n grid of land and water cells, find the water cell that is farthest from any land cell and return its Manhattan distance. Return -1 if no land or no water exists. Expected time complexity is O(n²).

“My first instinct was to BFS from each water cell individually and that's obviously too slow.”

View Post

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.”

View Post