Leetcode 1133. Largest Unique Number

Given an array of integers, find the largest value that appears exactly once; return -1 if no unique number exists. This requires counting frequencies (e.g., using a hash map) and selecting the maximum element with frequency one.