Travelling Salesman Problem (TSP)

This is a submission for DEV Computer Science Challenge v24.06.12: One Byte Explainer.

Explainer

Can a salesman visit a set of cities, each once, and return to the start with the shortest route? This is an NP-hard problem, meaning no efficient algorithm exists for large numbers of cities. It's impacts logistics, DNA sequencing, and more.

Additional Context