โ† Bloomberg questions
CodingReported in a candidate post, Nov 2024

Count pairs summing to a target with i < j

Filed under Bloomberg

Given an integer array A and an integer target, count the pairs of indices (i, j) with i < j such that A[i] + A[j] == target. Duplicate values are counted separately for each index pair.

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 Bloomberg questions

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