Helsing

Software Engineer

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 distanc...