---
tags: data_structure_python
---

# Find Numbers with Even Number of Digits <img src="https://img.shields.io/badge/-easy-brightgreen">

Given an array nums of integers, return how many of them contain an even number of digits.

<ins>**Example 1:**</ins>

Input: nums = [12,345,2,6,7896]
Output: 2
Explanation: 
12 contains 2 digits (even number of digits). 
345 contains 3 digits (odd number of digits). 
2 contains 1 digit (odd number of digits). 
6 contains 1 digit (odd number of digits). 
7896 contains 4 digits (even number of digits). 
Therefore only 12 and 7896 contain an even number of digits.

<ins>**Example 2:**</ins>

Input: nums = [555,901,482,1771]
Output: 1 
Explanation: 
Only 1771 contains an even number of digits.

**Constraints:**

- 1 <= nums.length <= 500
- 1 <= nums[i] <= 10^5

# Solution

class Solution:
    def findNumbers(self, nums: List[int]) -> int:
        count = 0
        for elt in nums:
            nb_digits = 0
            while elt > 0:
                nb_digits += 1
                elt = elt//10
            
            if nb_digits % 2 == 0:
                count += 1
        return count