Available question text
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.
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 1445. Apples & Oranges
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source