Implement `firstUnique(arr)` returning the first value that appears exactly once, or `null` if none. (A queue of candidates is the classic streaming approach.)
+ 1 hidden test run on Submit.
Counting then scanning in order finds the first unique value in O(n) time.
Run your code to see results.