Available question text
Given two sorted integer arrays, find the k-th smallest value among all pairwise products nums1[i]*nums2[j] without materializing all pairs; the core challenge is to binary-search the product value and count how many pairs are <= mid efficiently while handling negatives, zeros, and positives.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2040. Kth Smallest Product of Two Sorted Arrays
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source