NeetCode #301LC-2040HardBinary Search
← Back to All Problems#301 · #2040 · Kth Smallest Product of Two Sorted Arrays(两个有序数组的第 K 小乘积)
📌 Problem Statement & Constraints
Given two sorted arrays
nums1 and nums2 and an integer k, return the k-th smallest product among all nums1[i] * nums2[j]. Constraints: 1 <= nums1.length, nums2.length <= 5 * 10^4, -10^5 <= nums1[i], nums2[j] <= 10^5, 1 <= k <= nums1.length * nums2.length.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!