โ† Navi questions

Count unique pairs with specific sum condition involving reverses

Filed under Navi

The question

Count unique pairs of indices (i, j) in an array such that the sum of arr[i] and reverse(arr[j]) equals the sum of reverse(arr[i]) and arr[j].

No write-up yet. Related questions below have one.

Related Navi questions

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