Poor Valet car parking arrangement
Filed under Directi
The question
Given N parking spaces with cars numbered 1 to N initially scrambled and one empty parking slot (marked N), find the minimum number of single car moves required to rearrange all cars to their proper parking locations.
No write-up yet. Related questions below have one.
Related Directi questions
Collected from public candidate posts and coding forums. Updated Nov 2026.