Add solution #2040

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,702 LeetCode solutions in JavaScript
+# 1,703 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1564,6 +1564,7 @@
 2037|[Minimum Number of Moves to Seat Everyone](./solutions/2037-minimum-number-of-moves-to-seat-everyone.js)|Easy|
 2038|[Remove Colored Pieces if Both Neighbors are the Same Color](./solutions/2038-remove-colored-pieces-if-both-neighbors-are-the-same-color.js)|Medium|
 2039|[The Time When the Network Becomes Idle](./solutions/2039-the-time-when-the-network-becomes-idle.js)|Medium|
+2040|[Kth Smallest Product of Two Sorted Arrays](./solutions/2040-kth-smallest-product-of-two-sorted-arrays.js)|Hard|
 2047|[Number of Valid Words in a Sentence](./solutions/2047-number-of-valid-words-in-a-sentence.js)|Easy|
 2053|[Kth Distinct String in an Array](./solutions/2053-kth-distinct-string-in-an-array.js)|Medium|
 2071|[Maximum Number of Tasks You Can Assign](./solutions/2071-maximum-number-of-tasks-you-can-assign.js)|Hard|

solutions/2040-kth-smallest-product-of-two-sorted-arrays.js

@@ -0,0 +1,53 @@
+/**
+ * 2040. Kth Smallest Product of Two Sorted Arrays
+ * https://leetcode.com/problems/kth-smallest-product-of-two-sorted-arrays/
+ * Difficulty: Hard
+ *
+ * Given two sorted 0-indexed integer arrays nums1 and nums2 as well as an integer k, return
+ * the kth (1-based) smallest product of nums1[i] * nums2[j] where 0 <= i < nums1.length
+ * and 0 <= j < nums2.length.
+ */
+
+/**
+ * @param {number[]} nums1
+ * @param {number[]} nums2
+ * @param {number} k
+ * @return {number}
+ */
+var kthSmallestProduct = function(nums1, nums2, k) {
+  function countProducts(maxProduct) {
+    let count = 0;
+    for (const num1 of nums1) {
+      let left = 0;
+      let right = nums2.length;
+
+      if (num1 >= 0) {
+        while (left < right) {
+          const mid = Math.floor((left + right) / 2);
+          if (num1 * nums2[mid] <= maxProduct) left = mid + 1;
+          else right = mid;
+        }
+        count += left;
+      } else {
+        while (left < right) {
+          const mid = Math.floor((left + right) / 2);
+          if (num1 * nums2[mid] <= maxProduct) right = mid;
+          else left = mid + 1;
+        }
+        count += nums2.length - left;
+      }
+    }
+    return count;
+  }
+
+  let low = -(10 ** 10);
+  let high = 10 ** 10;
+
+  while (low < high) {
+    const mid = Math.floor((low + high) / 2);
+    if (countProducts(mid) >= k) high = mid;
+    else low = mid + 1;
+  }
+
+  return low;
+};