Leetcode 1445. Apples & Oranges

Given two lists of apples and oranges with numeric weights, pair apples to oranges to maximize the number of pairs whose weight difference is ≤ k (or equivalently minimize total pairing cost); this requires sorting and a greedy/two-pointer or matching-based approach to handle constraints efficiently.