Sum the XOR of Every Cross-Array Pair
Company: IBM
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: easy
Interview Round: Online Assessment
Overview: Compute the sum of XOR values across every pair drawn from two integer arrays without enumerating the full Cartesian product. The problem tests bit-frequency reasoning, duplicate handling, and overflow-safe accumulation under large input limits.