Most Beautiful Item for Each Query | Leetcode 2070

[@untitled6483]

Very good explanation with intuition.

[@techdose4u]

Thanks :)

[@pruthvinarayana9568]

Thanks for a new perspective , which makes more sense as a learner .

[@techdose4u]

Glad it helped :)

[@bitlandsaga]

Well, I was stuck on this question for two days and was finally able to solve it , but I am amazed by the number of optimizations in your code as compared to mine 😅. Anyways, thanks for such a lovely explanation.

[@techdose4u]

Nice hard work :)

[@webmaker01]

Thanks sir ji

[@techdose4u]

Welcom :)

[@avantikatripathi7959]

sir, why do we fix 1 while solving, like items[i][1], we increase the price value but not the beauty value??

[@techdose4u]

items[i][1] is the beauty value of item number i

[@SibiRanganathL]

just commenting for you

[@techdose4u]

Thanks 🙏🏼

[@amanqureshi3222]

class Solution {
public:
vector maximumBeauty(vector& items, vector& queries) {
sort(items.begin(),items.end());

int n=queries.size();
int m=items.size();

for(int i=1;i

[@techdose4u]

👍🏼

[@rajGg-h3g]

if i sort the query and then linear search ?

[@techdose4u]

That will work too :)
Sort both and perform linear search on both paralelly using 2 pointer