FastPrep
Problem · Array

Maximum Efficiency

Learn this problem
● MediumIBMNEW GRADOA
See IBM hiring insights

Problem statement

When evaluating a machine learning model, n test cases are provided. Each is associated with an arrivalTime[i] indicating the times each test case was given. The testing environment is activated once for some time, then enters an inactive state. If activated at time t1 and deactivated at time t2, tests with arrival times between t1 and t2 (inclusive) are executed. The total time the system was active is t2 - t1.

Efficiency of testing system = number of test cases tested / total time the system was active

Determine the maximum efficiency when the testing environment selects optimum activation and deactivation times. The active environment must execute at least two test cases during its active period. Return the maximum possible efficiency.

Notes:

  • Execution time for test cases is practically instantaneous; that is, it takes almost no time.
  • If two test cases share the same arrival time, they are evaluated simultaneously.
  • Efficiency may take negative values.

𓆞༄･ﾟVely much appreciated, spike!𓆝࿐

Function

maximumEfficiency(n: int, arrivalTime: int[]) → int

Examples

Example 1

n = 5arrivalTime = [9, 1, 3, 5, 6]return = 1
Example 1 illustration

It is optimal to choose t1 = 5 and t2 = 6. If the testing environment is active from t = 5 to 6, the 4th and 5th test cases will be executed. The number of test cases tested = 2 and the time the system was active is 6 - 5 = 1. The efficiency of the system is 2 - 1 = 1.

Return 1 as the answer.

Constraints

🍅🍅

More IBM problems

drafts saved locally
public int maximumEfficiency(int n, int[] arrivalTime) {
  // write your code here
}
n5
arrivalTime[9, 1, 3, 5, 6]
expected1
checking account