Add 2070. Most Beautiful Item for Each Query

Author: sierikov

src/main/scala/sierikov/leetcode/tasks/medium/MostBeautifulItemForEachQuery.scala

@@ -0,0 +1,41 @@
+package sierikov.leetcode.tasks.medium
+
+import sierikov.leetcode.tasks.easy.ConvertSortedListToBinarySearchTree.sortedListToBST
+
+// leetcode: https://leetcode.com/problems/most-beautiful-item-for-each-query/
+object MostBeautifulItemForEachQuery {
+  def maximumBeauty(items: Array[Array[Int]], queries: Array[Int]): Array[Int] = {
+
+    val sortedItems = items.sortBy(_.head) // sort by price
+    var max = sortedItems(0)(1) // first beauty
+
+    for (i <- sortedItems.indices) {
+      max = math.max(max, sortedItems(i)(1))
+      sortedItems(i)(1) = max
+    }
+
+    val ans = Array.ofDim[Int](queries.length)
+    for (i <- queries.indices) {
+      ans(i) = binarySearch(sortedItems, queries(i))
+    }
+
+    ans
+  }
+
+  private def binarySearch(items: Array[Array[Int]], targetPrice: Int): Int = {
+    var l = 0
+    var r = items.length - 1
+    var maxBeauty = 0
+    while (l <= r) {
+      val mid = (l + r) / 2
+      if (items(mid)(0) > targetPrice) {
+        r = mid - 1
+      } else {
+        // Found viable price. Keep moving to right
+        maxBeauty = math.max(maxBeauty, items(mid)(1))
+        l = mid + 1
+      }
+    }
+    maxBeauty
+  }
+}

src/test/scala/sierikov/leetcode/tasks/medium/MostBeautifulItemForEachQueryTest.scala

@@ -0,0 +1,16 @@
+package sierikov.leetcode.tasks.medium
+
+import org.scalatest.flatspec.AnyFlatSpec
+import org.scalatest.matchers.should.Matchers
+
+class MostBeautifulItemForEachQueryTest extends AnyFlatSpec with Matchers {
+  import MostBeautifulItemForEachQuery._
+
+  it should "find query correctly" in {
+    val items = Array(Array(1, 2), Array(3, 2), Array(2, 4), Array(5, 6), Array(3, 5))
+    val queries = Array(1, 2, 3, 4, 5, 6)
+
+    maximumBeauty(items, queries) shouldBe Array(2, 4, 5, 5, 6, 6)
+  }
+
+}