Helsing | Software Engineer (Mid Level) | Coding | Onsite

Train leetcode question A city’s metro runs a circular line with n stops, numbered 0 to n 1. Trains run in both directions: clockwise (0 → 1 → 2 → … → n 1 → 0) and counter clockwise. You’re given an integer array distances of length n, where distances[i] is the distance in km between stop i and stop (i + 1) % n. You’re also given a list of passenger journeys queries, where queries[j] = [start, destination]. For each...