3895. Count Digit Appearances

LeetCodeArrayMathOpen on judge ↗

You are given an integer array nums and an integer digit. Return the total number of times digit appears in the decimal representation of all elements in nums. Example 1: Input: nums = [12,54,32,22], digit = 2 Output: 4 Explanation: The digit 2 appears once in 12 and 32, and twice in 22. Thus, the total number of times digit 2 appears is 4. Example 2: Input: nums = [1,34,7], digit = 9 O

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI