Uptime Crew·Software Engineer·Onsite - Coding / Algorithms
Apr 2026
Coding round at Uptime Crew for a Software Engineer role. One problem, but it had a twist that made the standard solutions not good enough, which I did not see coming until I was already mid-explanation.
- Given an n x n grid where some cells contain thieves and others are empty, find the path from the top-left to the bottom-right corner that maximizes the minimum Manhattan distance from any thief. As a follow-up variant: if multiple paths tie on that maximum safeness factor, return the shortest one among them.
“I knew the base problem.” The rest of the author's notes on Software Engineer interview at Uptime Crew, Onsite - Coding / Algorithms round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.
View Post