Leetcode 870. Advantage Shuffle

Given two equal-length arrays, permute nums1 to maximize the number of positions where nums1[i] > nums2[i]. This is a greedy matching problem: sort nums1 and for each nums2 element assign the smallest nums1 that beats it (otherwise sacrifice the smallest remaining), which yields an optimal arrangement.

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 870. Advantage Shuffle

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact