Digit Count

CodeChefOpen on judge ↗

You are given an array of $N$ number, you need to find how many numbers in this array are $M$ digits long. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - The first line of each testcase contains of a single line of input, two integers $N,M$. - Second line of each test case contains $N$ integers $a1,a2,...aN.a1,a2,...aN$. ###Output: For each testcase,

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