Uptime Crew·Software Engineer·Onsite - Coding / Algorithms
- Given an n x n grid where some cells are marked as thief cells, find a path from the top-left to the bottom-right corner that maximizes the minimum Manhattan distance to any thief cell. If multiple paths tie on that safeness score, return the shortest one among them.
“I knew the base problem and went straight for binary search plus BFS, which felt clean.”