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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1445. Apples & Oranges

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact