Aurora Tech Phone Screen: Shortest Path in Hexagonal Grid Graph

Aurora full-time SDE phone interview involves finding the shortest distance between two points in a hexagonal grid graph using BFS and handling blockers.