# Maximum Sum of an Almost Unique Subarray (LeetCode 2673)
## Approach
Sliding window + freq map; unique count == k-ish.
## Edge cases
Empty level / single node / duplicates.
## Practice tip
State complexity before coding.
Interview prep: [https://www.linkjob.ai/](https://www.linkjob.ai/).