Reddit Question · Apr 2026 · USA

MAANG SWE rejection ( USA ) - correct solution but still no hire

SWE Phone Screen Hard
2 upvotes 15 replies

Question Details

You’re given trains with (source, destination, departure time, arrival time), and you start at time 0. You need to determine whether it’s possible to reach the destination such that each next train de

Full Details

You’re given trains with (source, destination, departure time, arrival time), and you start at time 0. You need to determine whether it’s possible to reach the destination such that each next train departs at or after the previous one arrives. Source: A Destination: D Trains:A → B (leave: 0, arrive: 4), B → D (leave: 5, arrive: 7) Op : True If B → D (leave: 3, arrive: 7) OP : False. After the interview, I searched for the question and found something very similar here: Similar leetcode : <a href="https://leetcode.com/discuss/post/6352084/🙏

Free preview. Unlock all questions →

Topics

Graphs Heap Stack Queue