How should I practice Maximum Blocks in a Constrained Cave?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Bloomberg LP onsite interview problems in FastPrep.

Is Maximum Blocks in a Constrained Cave associated with Bloomberg LP?

FastPrep tags this as a Bloomberg LP onsite interview coding practice problem when the problem catalog has that company and stage context.

Maximum Blocks in a Constrained Cave

Bloomberg LP● MediumNEW GRADONSITE INTERVIEW

Learn

Problem statement

Each block has unit width and fixed height. Each cave position has unit width and maximum height caveHeights[j]. Assign at most one block to each position; a block fits when its height is at most the position capacity.

Return the maximum number of blocks that can be placed. Blocks cannot rotate or stack.

Function

maximumCaveBlocks(blockHeights: int[], caveHeights: int[]) → int

Examples

Example 1

blockHeights = [4,2,3]caveHeights = [3,5]return = 2

Place height 2 in capacity 3 and height 3 or 4 in capacity 5.

Constraints

Each array contains at most 10^5 positive heights.