Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1879. Minimum XOR Sum of Two Arrays
Given two length-n arrays, permute nums2 to minimize the sum of pairwise XORs with nums1; with n ≤ 14 this is typically solved by an assignment-style bitmask DP over subsets to find the minimum total XOR.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.