Leetcode 137. Single Number II

Given an array where every element appears exactly three times except one that appears once, identify that unique element in O(n) time and O(1) extra space—typically by aggregating per-bit counts modulo 3 or using an equivalent bitwise state machine.