Check if Number Has Equal Digit Count and Digit Value Solution
Check if Number Has Equal Digit Count and Digit Value solution explained: step-by-step approach, complexity and code in Python, Java, C++ and JavaScript.
Check if Number Has Equal Digit Count and Digit Value is an easy coding problem on strings, hash table and counting, asked in TCS, Zoho and Cognizant interviews.
- Difficulty: Easy
- Topics: Strings, Hash Table, Counting
- Asked at: TCS, Zoho, Cognizant
- Time limit: 2 s
- Memory limit: 256 MB
- Languages: JavaScript, TypeScript, Python, Java, C++, C, C#, Go, Kotlin, Swift, Rust, PHP and Ruby
Problem statement
You are given a 0-indexed string num of digits.
Return true if, for every index i, the digit i occurs exactly num[i] times in num.
Example 1
Input: num = "1210"
Output: true
Explanation: Digit 0 occurs once, digit 1 twice, digit 2 once and digit 3 never — matching 1, 2, 1, 0.
Example 2
Input: num = "030"
Output: false
Explanation: num[0] says digit 0 appears 0 times, but it appears twice.
Example 3
Input: num = "1"
Output: false
Explanation: num[0] claims digit 0 appears once, and it never does.
Constraints
1 <= num.length <= 10num consists of digits.The digits of num are between 0 and 9.
Hints for Check if Number Has Equal Digit Count and Digit Value
Hint 1
Tally how often each digit
0..9appears.Hint 2
Then check position by position:
count[i]must equal the digit written atnum[i].Hint 3
Only positions
0throughn - 1are constrained — digits beyond the string's length are irrelevant.
How to solve Check if Number Has Equal Digit Count and Digit Value
The string is a self-describing claim: position i asserts how many times the digit i occurs. Tally first, then verify each claim.
Approach
- Build
count[0..9]over the characters ofnum. - For each index
ifrom0ton - 1, comparecount[i]with the numeric value ofnum[i]. - Return
falseon the first mismatch,trueotherwise.
Why it works
The claim at index i is exactly 'digit i occurs num[i] times', so a full tally followed by a positional comparison is a direct translation of the definition.
Complexity
- Time —
O(n) - Space —
O(1)
Pitfalls
- Comparing
count[i]withiinstead of with the digit at positionichecks the wrong thing. - Forgetting to convert the character to its numeric value compares a character code against a count.
Reference solution
Python
def digitCount(num: str) -> bool:
count = [0] * 10
for ch in num:
count[int(ch)] += 1
return all(count[i] == int(num[i]) for i in range(len(num)))Java
public static boolean digitCount(String num) {
int[] count = new int[10];
for (int i = 0; i < num.length(); i++) count[num.charAt(i) - '0']++;
for (int i = 0; i < num.length(); i++) {
if (count[i] != num.charAt(i) - '0') return false;
}
return true;
}C++
bool digitCount(string num) {
vector<int> count(10, 0);
for (char c : num) count[c - '0']++;
for (int i = 0; i < (int) num.size(); i++) {
if (count[i] != num[i] - '0') return false;
}
return true;
}JavaScript
var digitCount = function(num) {
var count = [];
for (var t = 0; t < 10; t++) count.push(0);
for (var i = 0; i < num.length; i++) count[num.charCodeAt(i) - 48]++;
for (var j = 0; j < num.length; j++) {
if (count[j] !== num.charCodeAt(j) - 48) return false;
}
return true;
};Also on the editorial tab: C, C#, Go, Kotlin, PHP, Ruby, Rust, Swift, TypeScript.
All 515 strings problems · the whole catalogue
Learn the technique: Strings · Hashing: Hash Maps and Hash Sets