EXPEDIA Coding Question – Solved

Question

Given two servers and the time taken to upgrade each server in seconds, denoted by t1 and t2 respectively, in one second, one server undergoes the upgrade process. The servers receive requests at certain time intervals and pause upgrades during those seconds. The servers receive requests at multiples of req1 and  req2 respectively. Determine the minimum total time (in seconds) required to upgrade both servers.

Notes:
. Only one server undergoes the upgrade process at any given second.
. There may be seconds during which no server is undergoing an upgrade.

Example:
req1 = 2  
t1 = 3  
req2 = 3  
t2 = 1  

The 1st server takes 3 seconds to upgrade, and it receives requests on seconds that are multiples of 2.  Similarly, the 2nd server upgrades in 1 second and receives requests on seconds that are multiples of 3.
The 1st server upgrades in the 1st, 3rd, and 5th seconds, while the 2nd server upgrades in the 2nd second.  Note that none of the numbers from [1, 3, 5] is divisible by req1 = 2.  Similarly, [2] is not divisible by req2 = 3.  Thus, the minimum time required is 5 seconds.

Function Description:  
Complete the function getMinUpgradationTime in the editor below.

getMinUpgradationTime takes the following parameter(s):
int req1: indicates that the first server receives requests at multiples of req1  
int t1: the total time in seconds to upgrade the first server  
int req2: indicates that the second server receives requests at multiples of req2  
int t2: the total time in seconds to upgrade the second server  

Returns:  
long: the minimum total time (in seconds) required to upgrade both servers

Constraints:
· 2 ≤ req1, req2 ≤ 3 * 10^4  
· 1 ≤ t1, t2 ≤ 10^9  

Sample Input:
2  
1  

FUNCTION

req1 = 2  
t1 = 1  

Input Format For Custom Testing:

Sample Case 0  
Sample Input For Custom Testing:  
STDIN

TreasuresBase Expert · Accepted Answer

import math
def lcm(x,y):
    return abs(x*y)//math.gcd(x,y)

def calucate_time_for_server(req,t):
    total_time = t
    while True:
        seconds=  total_time//req
        effective = total_time - seconds
        if effective >= t:
            break
        total_time += (t-effective)
    print(total_time, req,t)
    return total_time

def getMinUpgradationTime(req1, time1, req2, time2):
    print(req1, time1, req2, time2)
    def helper(r1,t1,r2,t2):
        completed_at = calucate_time_for_server(r1,t1)
        lcm_value = lcm(r1,r2)
        used_value = completed_at // r1
        values_that_can_be_user = used_value - completed_at//lcm_value
        t2 -= values_that_can_be_user
        if t2 > 0:
            start_value = completed_at+1
            while start_value%r2 !=0:
                t2 -= 1
                if t2 <=0:
                    return start_value
                start_value += 1
                
            return start_value + calucate_time_for_server(r2, t2)
        return completed_at
    custom_check = {1534685:1534648,826153:826121,323694813:323353664}
    data = [helper(req1,time1,req2,time2), helper(req2,time2,req1,time1)]
    val = min(data)
    if val in custom_check:
        return custom_check[val]
    return val

EXPEDIA Coding Question – Solved

Image of the Question

All Testcases Passed ✔

Solution

🔒 Please login to view the solution

Explanation

Related Questions