CodingHardcod-g902

Subject Sos dpLevel Senior–Staff~35 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Given an array 'nums' of non-negative integers, count the number of ordered pairs (i, j) (i and j range independently over all indices, including i == j) such that nums[i] & nums[j] == 0, where & is bitwise AND. Return the count. 1 <= len(nums) <= 40000, 0 <= nums[i] < 2^16.

Implement

count_and_zero_pairs(nums: list[int]) → int

Examples

in[[1,2,3]]out2

What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.