most-beautiful-item-for-each-query

Most Beautiful Item for Each Query

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

ruby

bash

swift

golang

scala

html

pythonml

kotlin

rust

typescript

racket

erlang

elixir

dart

maximumBeauty

You are given a 2D integer array <code>items</code> where <code>items[i] = [pricei, beautyi]</code> denotes the price and beauty of an item respectively.

You are also given a 0-indexed integer array <code>queries</code>. For each <code>queries[j]</code>, you want to determine the maximum beauty of an item whose price is less than or equal to <code>queries[j]</code>. If no such item exists, then the answer to this query is <code>0</code>.

Return an array <code>answer</code> of the same length as <code>queries</code> where <code>answer[j]</code> is the answer to the <code>jth</code> query.

&nbsp;
Example 1:

<pre>
Input: items = [[1,2],[3,2],[2,4],[5,6],[3,5]], queries = [1,2,3,4,5,6]
Output: [2,4,5,5,6,6]
Explanation:
- For queries[0]=1, [1,2] is the only item which has price &lt;= 1. Hence, the answer for this query is 2.
- For queries[1]=2, the items which can be considered are [1,2] and [2,4]. 
 The maximum beauty among them is 4.
- For queries[2]=3 and queries[3]=4, the items which can be considered are [1,2], [3,2], [2,4], and [3,5].
 The maximum beauty among them is 5.
- For queries[4]=5 and queries[5]=6, all items can be considered.
 Hence, the answer for them is the maximum beauty of all items, i.e., 6.
</pre>

Example 2:

<pre>
Input: items = [[1,2],[1,2],[1,3],[1,4]], queries = [1]
Output: [4]
Explanation: 
The price of every item is equal to 1, so we choose the item with the maximum beauty 4. 
Note that multiple items can have the same price and/or beauty. 
</pre>

Example 3:

<pre>
Input: items = [[10,1000]], queries = [5]
Output: [0]
Explanation:
No item has a price less than or equal to 5, so no item can be chosen.
Hence, the answer to the query is 0.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= items.length, queries.length &lt;= 105</code></li>
	<li><code>items[i].length == 2</code></li>
	<li><code>1 &lt;= pricei, beautyi, queries[j] &lt;= 109</code></li>
</ul>

Array

Binary Search

Sorting

Accenture

Accolite

Activision

Adobe

Aetion

Affinity

Affirm

Airbnb

Airtel

Akamai

Akuna Capital

Alation

Alibaba

AllinCall

alphonso

Altimetrik

Amazon

American Express

Analytics quotient

AppDynamics

Apple

AQR Capital Management LLC

Arcesium

Arista Networks

Asana

Ascend

Athenahealth

Atlassian

Audible

Avalara

Baidu

Barclays

BitGo

BlackRock

Blizzard

Bloomberg

Bolt

Booking.com

Bridgewater Associates

ByteDance

C3 IoT

Canonical

Capgemini

Capital One

Cashfree

Cisco

Citadel

Citrix

Clari

Cloudera

Code Studio

codeagon

Codenation

CoderByte

Cognizant

Cohesity

Coinbase

Commvault

Coupang

Coursera

Cruise Automation

Cryptic Studios

DailyHunt

Databricks

Dataminr

DE Shaw

Dell

Deloitte

Deutsche Bank

DiDi

Directi

Discord

Docusign

DoorDash

Drawbridge

Dropbox

Dunzo

Duolingo

eBay

edabit

Electronic Arts

Epam Systems

Epic Systems

epiFi

Evernote

Expedia

Facebook

FactSet

Fallible

Fleetx

Flipkart

ForUsAll

fourkites

Garena

GE Digital

GE Healthcare

Online Assessment

Phone Interview

On Campus Interview

Onsite Interview

Don't know

last week

last month

last 3 months

last 6 months

more than 6 months

other