How should I practice Get Max Throughput?

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

Is Get Max Throughput associated with Citadel?

FastPrep tags this as a Citadel online assessment coding practice problem when the problem catalog has that company and stage context.

Get Max Throughput

Citadel● HardINTERNNEW GRADOA

Learn

Problem statement

A data processing pipeline consists of n services connected in a series where output of the i^th service serves as the input of the (i + 1)^th service. However, the processing units have varying latenciesl, and the throughput of the i^th units is represented by the array throughput[i] in messages per minute. The first service receives input through an API, and the n^th service produces the final output.

Each service can be scaled up independently, with the cost of scaling up the i^th service on unit equal to scaling_cost[i]. After scaling up a service x times, it can process throughput[i] * (i + x) messages per minute.

Given the arrays throughput and scaling_cost, both of size n, and an integer budget representing the budget available, determine the optimal scaling configuration for the services such that the throughput generated by the n^th service is maximized.

Complete the function getMaxThroughput in the editor 👉👉.

getMaxThroughput has the following parameters:

1. int throughput[n]: the throughput generated by each of the n services
2. int scaling_cost[n]: the cost of scaling up a service one time
3. int budget: the available memory

long: the max value of the throughput generated at the end of the composite service after scaling within the budget.

Key insight:

_consider all feasible sol'ns_
Binary search across all possible throughput values, checking if can be attained within budget

Function

getMaxThroughput(throughput: int[], scaling_cost: int[], budget: int) → long

Examples

Example 1

throughput = [4, 2, 7]scaling_cost = [3, 5, 6]budget = 32return = 10

To maximize the throughput of the final service, an optimal solution is: When these units are applied in series, they generate a throughput of 10 units, the max possible throughput given the budget. Hence the answer is 10.

Example 2

throughput = [7, 3, 4, 6]scaling_cost = [2, 5, 4, 3]budget = 25return = 9

To maximize the throughput of the final service, an optimal solution is:

Constraints

404 not found 🥲