Find Building Where Alice and Bob Can Meet at Infosys

Hard52.2% acceptance

This problem has 75.0% frequency at Infosys.

Problem Description

You are given a **0-indexed** array `heights` of positive integers, where `heights[i]` represents the height of the `ith` building. If a person is in building `i`, they can move to any other building `j` if and only if `i < j` and `heights[i] < heights[j]`. You are also given another array `querie...

Read full problem and hints

Topics

Array Binary Search Stack Binary Indexed Tree Segment Tree Heap (Priority Queue)Monotonic Stack

Also asked at 4 companies

Amazon Bloomberg Google Meta

View Full Problem

Problem Description

Topics

Also asked at 4 companies

More Infosys Questions