How should I practice Get Total Requests?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Amazon online assessment problems in FastPrep.

Is Get Total Requests associated with Amazon?

FastPrep tags this as a Amazon coding interview or online assessment practice problem when the problem catalog has that company context.

FastPrep

Problem · Array

Get Total Requests

● EasyAmazonFULLTIMEOA

See Amazon hiring insights

Developers at Amazon have their applications deployed on n servers. Initially, the ith server has an id server[i] and can handle server[i] requests at a time.

For maintenance purposes, some servers are replaced periodically. On a jth day, all the servers with id equal to replaced[j] are replaced with servers with id newId[j] that can serve newId[j] requests. The total number of requests served on a jth day is the sum of the ids of the servers that the application is running on.

Given server, replaced, and newId, find the total number of requests served by the servers each day.

Note: The indices i and j are assumed to follow 1-based indexing.

Function Description

Complete the function getTotalRequests in the editor.

getTotalRequests takes the following arguments:

1. int server[n]: the initial server ids
2. int replaced[n]: the ids of the servers to replace
3. int newId[n]: the new ids of the replaced servers

Returns

int[]: an array of integers representing the total number of requests served each day

Examples

01 · Example 1

server = [20, 10]
replaced = [10, 20]
newId = [20, 1]
return = [40, 2]

Day 1: The servers are [20, 10]. Server with id 10 is replaced by a server with id 20. New servers are [20, 20]. Total requests = 20 + 20 = 40.

Day 2: The servers are [20, 20]. Server with id 20 is replaced by a server with id 1. New servers are [1, 1]. Total requests = 1 + 1 = 2.

Hence the answer is [40, 2].

02 · Example 2

server = [3, 3]
replaced = [3, 1]
newId = [1, 5]
return = [2, 10]

After the first day, the servers are [1, 1]. After the second day, the servers are [5, 5] :)

03 · Example 3

server = [2, 5, 2]
replaced = [2, 5, 3]
newId = [3, 1, 5]
return = [11, 7, 11]

After the first day, the servers are [3, 5, 3].) After the second day, the servers are [3, 1, 3] :) After the third day,the servers are [5, 1, 5] :)

Constraints

1 ≤ n ≤ 10^5
1 ≤ server[i], replaced[i], newId[i] < 10^4
server, replaced, and newId each have exactly n elements.