NoobieCoder3
BAN USER- 0of 0 votes
AnswersWe woild like to encourage passegers to experience the joy of travel using our transit system, therefore we would like to determine the longest path available to advertise the public. Specifically we would like to determine the longest possible trip on the transit sytem that will involve TWO tickets. The destinations must be connected, and all destinations must be unique.
- NoobieCoder3 in United States for Python development
You will be provided input in the format of CHI:NYC:719 where CHI is one location, NYC is a connected locatoion and 719 is the distance between the locations.
one line of output should be provided per line of input in the format of 3167:CHI:NYC:LA where 3167 is the distance of the trip, CHI is the starting, NYC is the intermediary location and LA is the final location.
sequence-------input---------------------------output
1------------------CHI:NYC:719----------------NONE
2------------------NYC:LA:2414----------------3133:CHI:NYC:LA
3------------------NYC:SEATTLE:2448------4862:LA:NYC:SEATTLE
4------------------NYC:HAWAII:4924---------7372:HAWAII:NYC:SEATTLE
Note: the start and end cities are lexicographical sorted.| Report Duplicate | Flag | PURGE
Jr. Software Engineer Python