Uber SDE Interview Question 2022 October | Graphs & Dynamic Programming | off-campus

Question 1: Number of Ways to Arrive at Destination Problem Statement You are in a city that consists of n intersections numbered from 0 to n - 1 with bi-directional roads between some intersections. You are given an array roads where roads[i] = [u, v, time] means that it takes time minutes to travel between intersections u and v. You want to know in how many strictly unique ways you can travel from intersection 0 to intersection n - 1 ...