# Fair Pay - Amazon Top Interview Questions

### Problem Statement :

```You are given a list of integers ratings representing the performance scores of programmers. The manager would like to give \$1 to every programmer except if two programmers are adjacent, they'd like to pay the better performing programmer at least \$1 higher than the worse performing one.

Return the minimum amount of dollars the manager can pay following above constraints.

Constraints

n ≤ 100,000 where n is the length of ratings.

Example 1

Input

ratings = [1, 2, 5, 1]

Output

7

Explanation

The minimum we can pay for each respective programmer is [1, 2, 3, 1]```

### Solution :

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

vector<int> left(r.size(), 1), right(r.size(), 1);
for  (int i=1; i<r.size(); i++) {
if (r[i] > r[i-1]) left[i] = left[i-1] + 1;
}
for (int i=r.size()-2; i>=0; i--) {
if (r[i] > r[i+1]) right[i] = right[i+1] + 1;
}

int ans = 0;
for (int i=0; i<r.size(); i++) ans += max(left[i], right[i]);
return ans;```
```

```                        ```Solution in Java :

import java.util.*;

class Solution {
public int solve(int[] ratings) {
if (ratings.length == 0)
return 0;
int[] left = new int[ratings.length];
int[] right = new int[ratings.length];
left[0] = 1;
for (int i = 1; i < ratings.length; i++) {
if (ratings[i] > ratings[i - 1]) {
left[i] = (1 + left[i - 1]);
} else
left[i] = 1;
}
right[ratings.length - 1] = 1;
for (int i = ratings.length - 2; i >= 0; i--) {
if (ratings[i] > ratings[i + 1]) {
right[i] = 1 + right[i + 1];
} else
right[i] = 1;
}
// System.out.println(Arrays.toString(left));
// System.out.println(Arrays.toString(right));
int[] pay = new int[ratings.length];
int cnt = 0;
for (int i = 0; i < ratings.length; i++) {
pay[i] = Math.max(left[i], right[i]);
cnt += pay[i];
}
return cnt;
}
}```
```

```                        ```Solution in Python :

class Solution:
def solve(self, ratings):
if not ratings:
return 0
n = len(ratings)
up = down = peak = 0
res = 1
for i in range(1, n):
if ratings[i - 1] < ratings[i]:
# going up case
up += 1
peak = up
down = 0
# 1 basic pay + up amount based on previous chain of increasing ratings
res += 1 + up
elif ratings[i - 1] == ratings[i]:
up = down = peak = 0
res += 1
else:
up = 0
down += 1
# down amount for chain of decreasing ratings + 1 basic pay if previous peak is smaller than current
res += down
if peak < down:
res += 1
return res```
```

## Unique Colors

You are given an unrooted tree of n nodes numbered from 1 to n . Each node i has a color, ci. Let d( i , j ) be the number of different colors in the path between node i and node j. For each node i, calculate the value of sum, defined as follows: Your task is to print the value of sumi for each node 1 <= i <= n. Input Format The first line contains a single integer, n, denoti

## Fibonacci Numbers Tree

Shashank loves trees and math. He has a rooted tree, T , consisting of N nodes uniquely labeled with integers in the inclusive range [1 , N ]. The node labeled as 1 is the root node of tree , and each node in is associated with some positive integer value (all values are initially ). Let's define Fk as the Kth Fibonacci number. Shashank wants to perform 22 types of operations over his tree, T

## 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