How should I practice Stores and Houses?

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

Is Stores and Houses associated with Google?

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

Problem · Array

Stores and Houses

Learn this problem

● EasyGoogleINTERNOA

See Google hiring insights

Problem statement

You are given 2 arrays representing integer locations of stores and houses (each location in this problem is one-dimensional). For each house, find the store closest to it. Return an integer array result where result[i] should denote the location of the store closest to the i-th house. If many stores are equidistant from a particular house, choose the store with the smallest numerical location. Note that there may be multiple stores and houses at the same location.

Function

findClosestStore(houses: int[], stores: int[]) → int[]

Examples

Example 1

houses = [5, 10, 17]stores = [1, 5, 20, 11, 16]return = [5, 11, 16]

The closest store to the house at location 5 is the store at the same location. The closest store to the house at location 10 is the store at the location 11. The closest store to the house at location 17 is the store at the location 16.

Example 2

houses = [2, 4, 2]stores = [5, 1, 2, 3]return = [2, 3, 2]

No explanation 👉🥹👈

Example 3

houses = [4, 8, 1, 1]stores = [5, 3, 1, 2, 6]return = [3, 6, 1, 1]