The challenge

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

Example 1:

Example 2:

Constraints:

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

The solution

class Solution {
    public int findNumbers(int[] nums) {
        // keep track of the amount to return
        int evens = 0;
        
        // loop through all the nums
        for (int i=0; i<nums.length; i++) {
            
            int digits = 0, num = nums[i];
            // while we divide by 10
            while (num!=0) {
                num /= 10;
                // increment our count
                ++digits;
            }
            
            // increment if even
            if (digits%2==0) evens++;
            
        }
        
        return evens;
    }
}