easy solution
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```javascript []
/**
 * @param {string} num
 * @return {boolean}
 */
var digitCount = function (num) {
    let digitFreq = new Array(10).fill(0);

    for (let digit of num) {
        digitFreq[Number(digit)]++
    };

    for (let i = 0; i < num.length; i++) {
        if (Number(num[i]) !== digitFreq[i]) {
            return false;
        }
    }
    return true;
};
```
['JavaScript']