Only One Group Has Exactly N
Among all groups of the same kind — all rows, or all columns — exactly one of them has a count of exactly N Suspects (or Innocents). Every other group must have a count different from N (either higher or lower). This is a global uniqueness constraint. It is violated as soon as two groups simultaneously reach N; therefore any deduction that would create a second group with count N must be rejected. Work by first identifying which group is the unique N-holder, then force all others away from N.
Reading the examples
“Only one row has exactly N suspects”
The clue says only one row has exactly 3 suspects. Given the revealed cells, the uniqueness constraint forces Diana (Suspect), Eve (Suspect), Frank (Suspect).
“Only one column has exactly N suspects”
The clue says only one column has exactly 3 suspects. Given the revealed cells, the uniqueness constraint forces Bob (Suspect), Eve (Suspect), Henry (Suspect).
“Only one neighborhood has exactly N suspects”
The clue says only one neighborhood has exactly 2 suspects. Given the revealed cells, the uniqueness constraint forces Diana (Innocent), Frank (Innocent), Henry (Suspect).