Fairtiq | Backend Engineer (Senior) | Coding | Phone Screen
EXexcerpt.tuition.6d·
Interview Date:July 22, 2026Region:EU (Europe)Hiring Team/Org:General Hire
Problem: Maximum Stations Reachable With One Connection A person wants to explore the city train network. Given the train network, which is a list of regular and connecting stations, write a function that finds the maximum number of stations a person can visit using at most one connecting station . Notes: The person can start travelling at any station in the network. The person can only go forward and can't skip any...
Sign in to view the full interview experience
Create or use your InterviewDB account to read the full Warren post and all shared details.
Sign in to continue0