@@ -0,0 +1,1339 @@
+package com.fishercoder.solutions;%0A%0Aimport java.util.Arrays;%0A%0A/**%0A * 1295. Find Numbers with Even Number of Digits%0A *%0A * Given an array nums of integers, return how many of them contain an even number of digits.%0A *%0A * Example 1:%0A * Input: nums = %5B12,345,2,6,7896%5D%0A * Output: 2%0A * Explanation:%0A * 12 contains 2 digits (even number of digits).%0A * 345 contains 3 digits (odd number of digits).%0A * 2 contains 1 digit (odd number of digits).%0A * 6 contains 1 digit (odd number of digits).%0A * 7896 contains 4 digits (even number of digits).%0A * Therefore only 12 and 7896 contain an even number of digits.%0A *%0A * Example 2:%0A * Input: nums = %5B555,901,482,1771%5D%0A * Output: 1%0A * Explanation:%0A * Only 1771 contains an even number of digits.%0A *%0A * Constraints:%0A * 1 %3C= nums.length %3C= 500%0A * 1 %3C= nums%5Bi%5D %3C= 10%5E5%0A * */%0Apublic class _1295 %7B%0A    public static class Solution1 %7B%0A        public int findNumbers(int%5B%5D nums) %7B%0A            int count = 0;%0A            for (int num : nums) %7B%0A                if (String.valueOf(num).length() %25 2 == 0) %7B%0A                    count++;%0A                %7D%0A            %7D%0A            return count;%0A        %7D%0A    %7D%0A%0A    public static class Solution2 %7B%0A        public int findNumbers(int%5B%5D nums) %7B%0A            return (int) Arrays.stream(nums).filter(num -%3E String.valueOf(num).length() %25 2 == 0).count();%0A        %7D%0A    %7D%0A%7D%0A

add 1295