# Number of Hops - Amazon Top Interview Questions

### Problem Statement :

```Given an integer list nums where each number represents the maximum number of hops you can make, return the minimum number of hops it would take to reach the last index starting at index 0. You can assume that you can always reach the last index.

Constraints

n ≤ 100,000 where n is the length of nums

Example 1

Input

nums = [3, 3, 2, 0, 1]

Output

2

Explanation

We can jump from index 0 to 1 and then jump straight to the last index by jumping 3 steps.```

### Solution :

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

int solve(vector<int>& nums) {
if (nums.empty()) return 0;
pair<int, int> interval{0, 0};
int n = nums.size();
if (n == 1) {
if (nums != 0)
return 1;
else
return 0;
}
int jumps = 0;
int can_reach;
while (true) {
jumps++;
can_reach = -1;
for (int i = interval.first; i <= interval.second; i++) {
can_reach = max(can_reach, i + nums[i]);
}
if (can_reach >= n - 1) return jumps;
interval = {interval.second + 1, can_reach};
}
}```
```

```                        ```Solution in Java :

import java.util.*;

class Solution {
public int solve(int[] a) {
int n = a.length;

int maxEnd = 0;
int currentEnd = 0;
int jumps = 0;

for (int i = 0; i < n; i++) {
maxEnd = Math.max(maxEnd, i + a[i]);
if (i != n - 1 && i == currentEnd) {
currentEnd = maxEnd;
jumps++;
}
}
return jumps;
}
}```
```

```                        ```Solution in Python :

class Solution:
def solve(self, nums):
n = len(nums)
ans = 0
hi = boundary = 0
for i in range(n):
hi = max(hi, i + nums[i])
if boundary == i < n - 1:
ans += 1
boundary = hi
return ans```
```

## Pair Sums

Given an array, we define its value to be the value obtained by following these instructions: Write down all pairs of numbers from this array. Compute the product of each pair. Find the sum of all the products. For example, for a given array, for a given array [7,2 ,-1 ,2 ] Note that ( 7 , 2 ) is listed twice, one for each occurrence of 2. Given an array of integers, find the largest v

## Lazy White Falcon

White Falcon just solved the data structure problem below using heavy-light decomposition. Can you help her find a new solution that doesn't require implementing any fancy techniques? There are 2 types of query operations that can be performed on a tree: 1 u x: Assign x as the value of node u. 2 u v: Print the sum of the node values in the unique path from node u to node v. Given a tree wi

## Ticket to Ride

Simon received the board game Ticket to Ride as a birthday present. After playing it with his friends, he decides to come up with a strategy for the game. There are n cities on the map and n - 1 road plans. Each road plan consists of the following: Two cities which can be directly connected by a road. The length of the proposed road. The entire road plan is designed in such a way that if o

## Heavy Light White Falcon

Our lazy white falcon finally decided to learn heavy-light decomposition. Her teacher gave an assignment for her to practice this new technique. Please help her by solving this problem. You are given a tree with N nodes and each node's value is initially 0. The problem asks you to operate the following two types of queries: "1 u x" assign x to the value of the node . "2 u v" print the maxim

## Number Game on a Tree

Andy and Lily love playing games with numbers and trees. Today they have a tree consisting of n nodes and n -1 edges. Each edge i has an integer weight, wi. Before the game starts, Andy chooses an unordered pair of distinct nodes, ( u , v ), and uses all the edge weights present on the unique path from node u to node v to construct a list of numbers. For example, in the diagram below, Andy

## Heavy Light 2 White Falcon

White Falcon was amazed by what she can do with heavy-light decomposition on trees. As a resut, she wants to improve her expertise on heavy-light decomposition. Her teacher gave her an another assignment which requires path updates. As always, White Falcon needs your help with the assignment. You are given a tree with N nodes and each node's value Vi is initially 0. Let's denote the path fr