Aurora计算机科学面试真题

The problem involves finding the shortest path in a hexagonal grid graph from point A to point B. The grid consists of cells shaped as hexagons, and you need to define traversal in six directions. The shortest path can be determined using breadth-first search (BFS). The follow-up question addresses the scenario where there are blockers on the graph that prevent traversal: simply do not include those blocked paths in the next traversal.

Implement a shared_ptr, including the move constructor. Discuss the implementation details and how you would handle memory management.

Design a cleaning system for a self-driving car that involves a primary compute module responsible for programming and a third-party Programmable Control Module (PCM) with High-Side Drivers (HSD) connected to valves for water and air. Discuss how you would design the system considering the inputs and outputs, the programmability of the PCM, and any constraints provided.

Design a system to monitor a self-driving car. If real-time data transmission to the server is interrupted while the car is on the road, should the car continue to drive or stop? Discuss how the system would handle such scenarios and what factors would influence the decision.