Skip to main content

Find Numbers with Even Number of Digits in Java | Programming Tutorial

Java Solution for Find Numbers with Even Number of Digits

Find Numbers with Even Number of Digits in Java | Programming Blog

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

Example 1 :-

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.

Example 2 :-

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

So lets see solution in Java :-

Solution 1 :-

import java.util.Scanner;

public class FindNumberswithEvenNumberofDigits {

    public static void main(String[] args) {
       
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter Array Size");
        int arraySize = sc.nextInt();
        int[] array = new int[arraySize];
       
        System.out.println("Enter Array Values");
        for (int i = 0; i < arraySize; i++) {
            array[i] = sc.nextInt();
        }

        int totalEven = 0 ;
        for (int number : array) {
            String s = String.valueOf(number);
            if (s.length() % 2 == 0) {
                totalEven++;
            }
        }
        System.out.println(totalEven);
    }

}

Explanation :-

  1. Get size of array using scanner.
  2. Declare array and assign its value from user.
  3. Loop through array values and convert into string.
  4. Check if number is Even or not, If number is even then increment totalEven variable by 1.
  5. Print totalEven value.

Solution 2 :-

import java.util.Scanner;

public class FindNumberswithEvenNumberofDigits {

    public static void main(String[] args) {
       
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter Array Size");
        int arraySize = sc.nextInt();
        int[] array = new int[arraySize];
       
        System.out.println("Enter Array Values");
        for (int i = 0; i < arraySize; i++) {
            array[i] = sc.nextInt();
        }

        int totalEven = 0;
        int count = 0;
        
        for (int i = 0; i < arraySize; i++) {
             int number = array[i];
           
             while(number > 0) {
                number = number / 10;
                count++;
            }
           
            if (count % 2 == 0) {
                totalEven++;
            }
            count = 0;
        }
       
     System.out.println(totalEven);
    }

}

Explanation :-

  1. Get Array Size from user.
  2. Insert values in array using for loop.
  3. Loop through array values.
  4. Divide the number using 10 until number become 0. And increment count by one. If number is Even then count will store even number otherwise Odd.
  5. Last, check if (number % 2) become is 0 then it is Even otherwise Odd. and increment totalEven variable one if number is Even.


Happy Coding.

Other Problem and Solution in Java you may like :-

Comments

Popular posts from this blog

Plus Minus HackerRank Solution in Java | Programming Blog

Java Solution for HackerRank Plus Minus Problem Given an array of integers, calculate the ratios of its elements that are positive , negative , and zero . Print the decimal value of each fraction on a new line with 6 places after the decimal. Example 1 : array = [1, 1, 0, -1, -1] There are N = 5 elements, two positive, two negative and one zero. Their ratios are 2/5 = 0.400000, 2/5 = 0.400000 and 1/5 = 0.200000. Results are printed as:  0.400000 0.400000 0.200000 proportion of positive values proportion of negative values proportion of zeros Example 2 : array = [-4, 3, -9, 0, 4, 1]  There are 3 positive numbers, 2 negative numbers, and 1 zero in array. Following is answer : 3/6 = 0.500000 2/6 = 0.333333 1/6 = 0.166667 Lets see solution Solution 1 import java.io.*; import java.math.*; import java.security.*; import java.text.*; import java.util.*; import java.util.concurrent.*; import java.util.function.*; import java.util.regex.*; import java.util.stream.*; import static java.util.st

Flipping the Matrix HackerRank Solution in Java with Explanation

Java Solution for Flipping the Matrix | Find Highest Sum of Upper-Left Quadrant of Matrix Problem Description : Sean invented a game involving a 2n * 2n matrix where each cell of the matrix contains an integer. He can reverse any of its rows or columns any number of times. The goal of the game is to maximize the sum of the elements in the n *n submatrix located in the upper-left quadrant of the matrix. Given the initial configurations for q matrices, help Sean reverse the rows and columns of each matrix in the best possible way so that the sum of the elements in the matrix's upper-left quadrant is maximal.  Input : matrix = [[1, 2], [3, 4]] Output : 4 Input : matrix = [[112, 42, 83, 119], [56, 125, 56, 49], [15, 78, 101, 43], [62, 98, 114, 108]] Output : 119 + 114 + 56 + 125 = 414 Full Problem Description : Flipping the Matrix Problem Description   Here we can find solution using following pattern, So simply we have to find Max of same number of box like (1,1,1,1). And last