How should I practice Maximize Number of Produced Cars?

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

Is Maximize Number of Produced Cars associated with Microsoft?

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

FastPrep

Problem · Array

Maximize Number of Produced Cars

● MediumMicrosoftNEW GRADOA

See Microsoft hiring insights

A car manufacturer has data about the production processes of N different cars (numbered from 0 to N-1) and wants to maximize the number of cars produced in the upcoming month. The manufacturing information is described by an array H, where H[K] denotes the number of hours required to produce the K-th car.

There are two assembly lines in the factory, the first of which works for X, and the second Y, hours in a month. Every car can be constructed using either one of these lines. Only one car at a time can be produced on each assembly line and it is not possible to switch lines after starting the car's production.

What is the maximum number of different cars that can be produced in the upcoming month?

Function Description

Write a function:

class Solution { public int solution(int[] H, int X, int Y); }

that, given an array H of N integers and two integers X and Y, returns the maximum number of different cars that can be produced in the upcoming month by assigning cars to assembly lines in an optimal way.

Examples

01 · Example 1

H = [1, 1, 3]
X = 1
Y = 1
return = 2

Only cars whose assembly time requires 1 hour can be constructed.

02 · Example 2

H = [6, 5, 5, 4, 3]
X = 8
Y = 9
return = 4

The cars that need 3 and 5 hours can be produced on the first assembly line while the second car that needs 5 hours and the car that needs 4 hours can be produced using the second line.

03 · Example 3

H = [6, 5, 2, 1, 8]
X = 17
Y = 5
return = 5

The car that needs 5 hours can be produced on the second line and the four other cars can be produced on the first line.

04 · Example 4

H = [5, 5, 4, 6]
X = 8
Y = 8
return = 2

Only one car can be produced on each line.

Constraints

N is an integer within the range [1..1,000];
each element of array H is an integer within the range [1..1,000];
X and Y are integers within the range [1..500].