How should I practice Request Redirection?

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

Is Request Redirection associated with Epifi?

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

Problem · Binary Search

Request Redirection

Learn this problem

● HardEpifiOA

Problem statement

The hackers of Hackerland want to deploy their applications on n servers. The ith server has requests[i] requests to serve but can serve a maximum of max_req[i] requests only.

In order to balance the load, the hackers need to redirect some requests of ith server to some other server. For each request that is redirecting the request from ith server to jth server, the latency is |i-j| where |i-j| represents the absolute value of i-j. The max_latency is defined as the maximum latency induced among all the redirections.

Given the number of servers n, requests array, find the minimum possible max_latency if the requests are redirected properly. Note that each server has to serve less than the maximum requests it can serve. If there is no way to serve all the requests, report -1 as the answer.

Function

getMinLatency(requests: int[], max_req: int[]) → int

Complete the function getMinLatency in the editor.

getMinLatency has the following parameters:

requests[n]: An array of integers
max_req[n]: An array of integers

Returns

int: The minimal max_latency possible respecting the given conditions.

🌼 All credit goes to the amazing friend who helped out!

Examples

Example 1

requests = [1, 3, 2, 4]max_req = [2, 1, 5, 3]return = 2

We can redirect 2 requests from the second server to be the third server and 1 request from the fourth server to the third server. The max latency is equal to max(|2 - 1|, |3 - 2|) = 1. It can be shown that this is the min possible max_latency possible.

Constraints

1 ≤ n ≤ 10^5