How should I practice Place K Buildings to Minimize Maximum Grid Distance?

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

Is Place K Buildings to Minimize Maximum Grid Distance associated with Oracle?

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

Problem · Matrix

Place K Buildings to Minimize Maximum Grid Distance

Learn this problem

● Hard

OracleFULLTIMEONSITE INTERVIEW

Problem statement

Consider an empty grid with rows rows and columns columns. Place exactly k buildings in distinct cells.

The distance from a cell to its closest building is the minimum Manhattan distance to any building. Return the smallest possible value of the maximum such distance over every grid cell.

Function

minimumMaximumDistance(rows: int, columns: int, k: int) → int

Examples

Example 1

rows = 3columns = 3k = 1return = 2

Placing the building in the center leaves every corner at Manhattan distance 2.

Example 2

rows = 2columns = 3k = 2return = 1

Buildings in the middle column make every cell at most one step from a building.

Constraints

1 <= rows, columns <= 8
1 <= k <= rows * columns
Buildings occupy distinct cells.