Leetcode 2040. Kth Smallest Product of Two Sorted Arrays

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.