dsa2 min read
Count Bad Pairs — Complement Counting with HashMap
Count pairs (i,j) where j-i != nums[j]-nums[i] by counting good pairs via frequency map of nums[i]-i.
Read →
Complement-map
2 articles
dsa2 min read
Count Good Meals — Power-of-Two Complement HashMap
Count pairs summing to a power of 2 by checking all 22 powers-of-2 against a running frequency map.
Read →