โ† Walmart questions
CodingReported in a candidate post, Jul 2025

Count combinations with A[i] + B[j] = B[k] + C[l]

Filed under Walmart

Given three unsorted integer arrays A, B and C, count the index combinations (i, j, k, l) such that A[i] + B[j] = B[k] + C[l]. Arrays may contain duplicates and negatives, and k may equal j.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Walmart questions

Collected from public candidate posts and coding forums. Updated Nov 2026.