There is $n$ lists (of integers) of the same length. I want to find the zeros global intersections of those lists.
$A = [4,6,3,0,7,0,0,0,1,0,0]$
$B = [6,6,7,1,7,0,0,0,4,0,0]$
$C = [2,4,7,0,7,0,0,0,3,0,0]$
The positions are $5, 6, 7, 9$ and $10$
Other than "traversing" the list and checking element by element, is there another way ?