Luxoft Parking System Hackathon

Hackathon Achievement: Secured 4th place in the Luxoft Parking Hackathon by engineering a parking optimization solution within a strict 8-hour timeframe.

Algorithmic Logic: Implemented Breadth-First Search (BFS) and Manhattan Distance algorithms in C++ to calculate the most efficient path to the nearest available parking spot in a grid-based system.

Grid System Simulation: Designed a dynamic coordinate system that manages various states such as Empty, Occupied, and Obstacle, ensuring robust handling of edge cases like invalid coordinates or fully occupied lots.

Console Visualization: Developed a real-time console-based interface to visualize parking scenarios, enabling features like manual vehicle placement, obstacle generation, and nearest spot detection.