# Unique Paths to Go Home - Google Top Interview Questions

### Problem Statement :

```You are given a two-dimensional list of integers edges where each element contains [u, v, distance] representing a weighted undirected graph. You are currently at node 0 and your home is the largest node. You can go from u to v if it's immediately connected and the shortest distance from u to home is larger than the shortest distance from v to home.

Return the number of unique paths possible to go from node 0 to home. Mod the result by 10 ** 9 + 7.

Constraints

1 ≤ n ≤ 100,000 where n is the length of edges

0 ≤ distance

Example 1

Input

edges = [

[0, 1, 1],

[1, 2, 1],

[2, 3, 1],

[1, 3, 2]

]

Output

2

Explanation

There are two unique paths to go home:

We can go 0 to 1 then 1 to 2 then 2 to 3

We can go 0 to 1 then 1 to 3

Example 2

Input

edges = [

[0, 1, 1],

[0, 2, 1],

[1, 2, 2]

]

Output

1

Explanation

There is one unique path to go home: go 0 to 2

We can't go through 0 -> 1 -> 2 because the shortest distance from 0 to 2 is smaller than 1 to 2```

### Solution :

```                        ```Solution in C++ :

long long dp;
long long dist;
int n;
vector<pair<int, int>> edges;
int solve(vector<vector<int>>& graph) {
// begin graph initialization
n = 0;
for (auto& edge : graph) {
n = max(n, edge);
n = max(n, edge);
}
n++;
for (int i = 0; i < n; i++) edges[i].clear();
for (auto& edge : graph) {
edges[edge].emplace_back(edge, edge);
edges[edge].emplace_back(edge, edge);
}
// end graph initialization

// begin dijkstra
for (int i = 0; i < n; i++) dist[i] = 1e18;
dist[n - 1] = 0;
priority_queue<pair<long long, long long>> q;
q.emplace(0, n - 1);
vector<int> orderv;
while (q.size()) {
auto [w, v] = q.top();
q.pop();
w *= -1;
if (dist[v] != w) continue;
orderv.push_back(v);
for (auto edge : edges[v]) {
if (dist[edge.first] > dist[v] + edge.second) {
dist[edge.first] = dist[v] + edge.second;
q.emplace(-dist[edge.first], edge.first);
}
}
}
// end dijkstra

// begin path counting
for (int i = 0; i < n; i++) dp[i] = 0;
dp[n - 1] = 1;
const int MOD = 1000000007;
for (int currv : orderv) {
for (auto& edge : edges[currv]) {
if (dist[edge.first] < dist[currv]) {
dp[currv] += dp[edge.first];
dp[currv] %= MOD;
}
}
}
// end path counting
return dp;
}```
```

```                        ```Solution in Java :

import java.util.*;

class Solution {
public int solve(int[][] edges) {
int N = 0;
for (int[] edge : edges) N = Math.max(N, Math.max(edge, edge));
N++;
ArrayList<State>[] graph = new ArrayList[N];
for (int i = 0; i < N; i++) graph[i] = new ArrayList<State>();
for (int[] e : edges) {
long w = (long) e;
}

// Dijkstra's Algorithm
long[] distances = new long[N];
Arrays.fill(distances, Long.MAX_VALUE);
distances[N - 1] = 0L;
PriorityQueue<State> pq = new PriorityQueue<State>();
State s = new State(N - 1, 0L);
while (!pq.isEmpty()) {
s = pq.poll();
for (State e : graph[s.node]) {
if (distances[e.node] > distances[s.node] + e.dist) {
distances[e.node] = distances[s.node] + e.dist;
}
}
}
State[] vals = new State[N];
for (int i = 0; i < N; i++) vals[i] = new State(i, distances[i]);
Arrays.sort(vals);

long[] ans = new long[N];
ans[N - 1] = 1L;
for (int i = 1; i < N; i++) {
int u = vals[i].node;
for (State e : graph[u]) {
int v = e.node;
if (distances[u] > distances[v])
ans[u] = (ans[u] + ans[v]) % 1000000007;
}
}
return (int) ans;
}

static class State implements Comparable<State> {
int node;
long dist;
public State(int n, long d) {
node = n;
dist = d;
}

public int compareTo(State s) {
return Long.compare(dist, s.dist);
}
}
}```
```

```                        ```Solution in Python :

class Solution:
def solve(self, edges):
MOD = 10 ** 9 + 7

graph = defaultdict(dict)
for u, v, w in edges:
graph[u][v] = graph[v][u] = w

# Find distance from home to nodes with Dijkstra
home = max(graph)
dist = defaultdict(lambda: float("inf"))
dist[home] = 0
pq = [[0, home]]
while pq:
d, node = heappop(pq)
if dist[node] < d:
continue

for nei, w in graph[node].items():
if d + w < dist[nei]:
heappush(pq, [d + w, nei])
dist[nei] = d + w

# DP on topological order
nodes = sorted(graph, key=dist.__getitem__)
dp = defaultdict(int)
dp[home] = 1
for u in nodes:
for v in graph[u]:
if dist[v] > dist[u]:
dp[v] += dp[u]
dp[v] %= MOD

return dp```
```

## Swap Nodes [Algo]

A binary tree is a tree which is characterized by one of the following properties: It can be empty (null). It contains a root node only. It contains a root node with a left subtree, a right subtree, or both. These subtrees are also binary trees. In-order traversal is performed as Traverse the left subtree. Visit root. Traverse the right subtree. For this in-order traversal, start from

## Kitty's Calculations on a Tree

Kitty has a tree, T , consisting of n nodes where each node is uniquely labeled from 1 to n . Her friend Alex gave her q sets, where each set contains k distinct nodes. Kitty needs to calculate the following expression on each set: where: { u ,v } denotes an unordered pair of nodes belonging to the set. dist(u , v) denotes the number of edges on the unique (shortest) path between nodes a

## Is This a Binary Search Tree?

For the purposes of this challenge, we define a binary tree to be a binary search tree with the following ordering requirements: The data value of every node in a node's left subtree is less than the data value of that node. The data value of every node in a node's right subtree is greater than the data value of that node. Given the root node of a binary tree, can you determine if it's also a

## Square-Ten Tree

The square-ten tree decomposition of an array is defined as follows: The lowest () level of the square-ten tree consists of single array elements in their natural order. The level (starting from ) of the square-ten tree consists of subsequent array subsegments of length in their natural order. Thus, the level contains subsegments of length , the level contains subsegments of length , the

## Balanced Forest

Greg has a tree of nodes containing integer data. He wants to insert a node with some non-zero integer value somewhere into the tree. His goal is to be able to cut two edges and have the values of each of the three new trees sum to the same amount. This is called a balanced forest. Being frugal, the data value he inserts should be minimal. Determine the minimal amount that a new node can have to a

## Jenny's Subtrees

Jenny loves experimenting with trees. Her favorite tree has n nodes connected by n - 1 edges, and each edge is ` unit in length. She wants to cut a subtree (i.e., a connected part of the original tree) of radius r from this tree by performing the following two steps: 1. Choose a node, x , from the tree. 2. Cut a subtree consisting of all nodes which are not further than r units from node x .