Fountain Safety
Google● MediumINTERNONSITE INTERVIEWProblem statement
You are given an integer array terrain of length n, where terrain[i] is the height at position i. You are also given a strictly increasing integer array fountains containing the positions of the fountains.
A fountain at position f emits water at level terrain[f] in both directions. In either direction, its water crosses consecutive positions whose height is less than or equal to that level and stops before the first position whose height is strictly greater.
Examples
Example 1
terrain = [2, 1, 3, 2, 1, 1]fountains = [0, 3]return = [0, 1, 0, 0, 1, 1]Fountain 0 waters position 1, then stops before the higher position 2. Fountain 3 waters positions 4 and 5. Neither fountain waters its own position.
Unlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 2 more worked examples, explained
- Guided hints and editorial
- Run your code on real test cases
$99 billed yearly — or $19 month-to-month. Cancel anytime.