434. Unique Element Frequency Counter

Given an array of integers nums, return an array containing the frequency of each unique element present in nums. The order of frequencies in the output array does not matter. Use a hash map (or dictionary/object) to count frequencies first.

Example Input: nums = [1, 2, 2, 3, 1, 1]
Example Output: [3, 2, 1] (Frequencies of 1, 2, and 3 respectively)

Run this challenge interactively in Python or JavaScript when the app loads.