Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Meeting Rooms II
Coding · Array · Greedy · Heap (Priority Queue)
- Valid Triangle Number
Coding · Array · Binary Search · Greedy
- 3Sum
Coding · Array · Sorting · Two Pointers
- 3Sum Closest
Coding · Array · Sorting · Two Pointers
Sources · 2 references
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 870. Advantage Shuffle
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Walmart Labs
Advantage Shuffle
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 73.5. This is not an interview probability.
View source