How do I practice coding and algorithm questions?

Use PracHub's coding console to write, test, and debug your solutions in Python or JavaScript. View hints, test against sample inputs, and compare with official solutions.

What difficulty level is this coding question?

This is a medium difficulty Coding & Algorithms question, commonly asked during Technical Screen rounds at Meta.

What role is this question designed for?

This question is commonly asked for Software Engineer candidates at Meta during technical interviews.

Find buildings with rightward view | Meta Coding Question

Quick Overview

This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Find buildings with rightward view states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

Find buildings with rightward view

Company: Meta

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Technical Screen

You are given an array of building heights aligned along a street that faces the ocean to the right. Return the indices of buildings that can see the ocean (no strictly taller building to their right). Output indices in increasing order. Provide an O(n) solution and discuss variations for leftward views or non-strict comparisons.

Quick Answer: This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Find buildings with rightward view states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

You are given an integer array `heights` representing the heights of buildings aligned along a street that faces the ocean to the right. A building has an ocean view if there is no strictly taller building to its right. Return the list of indices (0-based) of all buildings that can see the ocean, in increasing order. Aim for an O(n) solution. Note that the rightmost building always has an ocean view, and a building blocks another only when it is *strictly* taller. Example: - Input: heights = [4, 2, 3, 1] - Output: [0, 2, 3] - Explanation: Building 3 (height 1) is rightmost so it sees the ocean. Building 2 (height 3) has only height 1 to its right, so it sees the ocean. Building 1 (height 2) is blocked by building 2 (height 3). Building 0 (height 4) is taller than everything to its right, so it sees the ocean.

Constraints

1 <= heights.length <= 10^5 (the harness also accepts an empty array, returning [])
1 <= heights[i] <= 10^9
Output indices must be in strictly increasing order

Examples

Input: ([4, 2, 3, 1],)

Expected Output: [0, 2, 3]

Explanation: Index 3 (rightmost) sees ocean. Index 2 (h=3) only has h=1 to its right. Index 1 (h=2) is blocked by index 2 (h=3). Index 0 (h=4) is taller than all to its right.

Input: ([4, 3, 2, 1],)

Expected Output: [0, 1, 2, 3]

Explanation: Strictly decreasing heights: every building is taller than all buildings to its right, so all see the ocean.

Hints

Scan from right to left. A building sees the ocean iff it is taller than every building already seen to its right.
Track the maximum height encountered so far while scanning right-to-left. A strictly taller building qualifies and updates that maximum.
Because you scan right-to-left, collected indices come out in decreasing order — reverse them (or prepend) to return increasing order.
For a LEFTWARD view, scan left-to-right with the same running-max logic. For NON-STRICT comparisons (>= blocks), change the comparison from `>` to `>` against the max but treat equal heights as blocking by comparing with `>=` from the blocker's perspective — i.e. keep a building only when it is strictly greater than the running max even under non-strict rules the running-max approach still applies, just adjust whether equal heights block.