Nov 12

Author: siddydutta

2024-11-November-LeetCoding-Challenge/Most Beautiful Item for Each Query.py

@@ -0,0 +1,44 @@
+from bisect import bisect_right
+from typing import List
+
+
+class Solution:
+    def maximumBeauty(
+            self, items: List[List[int]], queries: List[int]
+    ) -> List[int]:
+        # sort items by price, then reverse beauty
+        items.sort(key=lambda i: (i[0], -i[1]))
+        # max accumulate beauty
+        max_beauty = items[0][1]
+        for item in items[1:]:
+            max_beauty = max(max_beauty, item[1])
+            item[1] = max_beauty
+        # extract prices for bisect
+        prices = [item[0] for item in items]
+        # most beautiful item for each query
+        answer = []
+        for query in queries:
+            idx = bisect_right(prices, query)
+            if idx > 0:
+                answer.append(items[idx-1][1])
+            else:
+                answer.append(0)
+        return answer
+
+
+def main():
+    items = [[1, 2], [3, 2], [2, 4], [5, 6], [3, 5]]
+    queries = [1, 2, 3, 4, 5, 6]
+    assert Solution().maximumBeauty(items, queries) == [2, 4, 5, 5, 6, 6]
+
+    items = [[1, 2], [1, 2], [1, 3], [1, 4]]
+    queries = [1]
+    assert Solution().maximumBeauty(items, queries) == [4]
+
+    items = [[10, 1000]]
+    queries = [5]
+    assert Solution().maximumBeauty(items, queries) == [0]
+
+
+if __name__ == '__main__':
+    main()

2024-11-November-LeetCoding-Challenge/README.md

@@ -14,7 +14,7 @@
 | November 9  | [3133. Minimum Array End](https://leetcode.com/problems/minimum-array-end/) | Medium | Unsolved |
 | November 10 | [3097. Shortest Subarray With OR at Least K II](https://leetcode.com/problems/shortest-subarray-with-or-at-least-k-ii/) | Medium | Unsolved |
 | November 11 | [2601. Prime Subtraction Operation](https://leetcode.com/problems/prime-subtraction-operation/) | Medium | Unsolved |
-| November 12 | []() |  |  |
+| November 12 | [2070. Most Beautiful Item for Each Query](https://leetcode.com/problems/most-beautiful-item-for-each-query/) | Medium | Solved |
 | November 13 | []() |  |  |
 | November 14 | []() |  |  |
 | November 15 | []() |  |  |
@@ -38,5 +38,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 3 | 3 | 0 |
-| Medium | 8 | 2 | 6 |
+| Medium | 9 | 3 | 6 |
 | Hard   | 0 | 0 | 0 |