Added task 2070.

Author: AryamanMishra

src/main/java/g2001_2100/s2070_most_beautiful_item_for_each_query/Solution.java

@@ -0,0 +1,29 @@
+package g2001_2100.s2070_most_beautiful_item_for_each_query;
+
+// #Medium #Array #Sorting #Binary_Search
+// #2022_05_30_Time_53_ms_(96.04%)_Space_119.9_MB_(48.51%)
+
+import java.util.Arrays;
+import java.util.Comparator;
+
+public class Solution {
+    public int[] maximumBeauty(int[][] items, int[] queries) {
+        int[] res = new int[queries.length];
+        Arrays.sort(items, Comparator.comparingInt((a) -> a[1]));
+        for (int i = 0; i < res.length; i++) {
+            res[i] = maxBeauty(items, queries[i]);
+        }
+        return res;
+    }
+
+    private int maxBeauty(int[][] items, int query) {
+        for (int i = items.length - 1; i >= 0; i--) {
+            int price = items[i][0];
+            int beauty = items[i][1];
+            if (price <= query) {
+                return beauty;
+            }
+        }
+        return 0;
+    }
+}

src/main/java/g2001_2100/s2070_most_beautiful_item_for_each_query/readme.md

@@ -0,0 +1,55 @@
+2070\. Most Beautiful Item for Each Query
+
+Medium
+
+You are given a 2D integer array `items` where <code>items[i] = [price<sub>i</sub>, beauty<sub>i</sub>]</code> denotes the **price** and **beauty** of an item respectively.
+
+You are also given a **0-indexed** integer array `queries`. For each `queries[j]`, you want to determine the **maximum beauty** of an item whose **price** is **less than or equal** to `queries[j]`. If no such item exists, then the answer to this query is `0`.
+
+Return _an array_ `answer` _of the same length as_ `queries` _where_ `answer[j]` _is the answer to the_ <code>j<sup>th</sup></code> _query_.
+
+**Example 1:**
+
+**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 <= 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. 
+
+**Example 2:**
+
+**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. 
+
+**Example 3:**
+
+**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. 
+
+**Constraints:**
+
+*   <code>1 <= items.length, queries.length <= 10<sup>5</sup></code>
+*   `items[i].length == 2`
+*   <code>1 <= price<sub>i</sub>, beauty<sub>i</sub>, queries[j] <= 10<sup>9</sup></code>

src/test/java/g2001_2100/s2070_most_beautiful_item_for_each_query/SolutionTest.java

@@ -0,0 +1,38 @@
+package g2001_2100.s2070_most_beautiful_item_for_each_query;
+
+import static org.hamcrest.CoreMatchers.equalTo;
+import static org.hamcrest.MatcherAssert.assertThat;
+
+import com_github_leetcode.CommonUtils;
+import org.junit.jupiter.api.Test;
+
+class SolutionTest {
+    @Test
+    public void maximumBeauty() {
+        int[][] items =
+                CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                        "[1,2],[3,2],[2,4],[5,6],[3,5]");
+        int[] queries = new int[] {1, 2, 3, 4, 5, 6};
+        int[] expected = new int[] {2, 4, 5, 5, 6, 6};
+        assertThat(new Solution().maximumBeauty(items, queries), equalTo(expected));
+    }
+
+    @Test
+    public void maximumBeauty2() {
+        int[][] items =
+                CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                        "[1,2],[1,2],[1,3],[1,4]");
+        int[] queries = new int[] {1};
+        int[] expected = new int[] {4};
+        assertThat(new Solution().maximumBeauty(items, queries), equalTo(expected));
+    }
+
+    @Test
+    public void maximumBeauty3() {
+        int[][] items =
+                CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[10,1000]");
+        int[] queries = new int[] {5};
+        int[] expected = new int[] {0};
+        assertThat(new Solution().maximumBeauty(items, queries), equalTo(expected));
+    }
+}