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

Queen's Attack II HackerRank Solution in Java with Explanation

Queen's Attack II Problem's Solution in Java (Chessboard Problem)   Problem Description : You will be given a square chess board with one queen and a number of obstacles placed on it. Determine how many squares the queen can attack.  A queen is standing on an n * n chessboard. The chess board's rows are numbered from 1 to n, going from bottom to top. Its columns are numbered from 1 to n, going from left to right. Each square is referenced by a tuple, (r, c), describing the row r and column c, where the square is located. The queen is standing at position (r_q, c_q). In a single move, queen can attack any square in any of the eight directions The queen can move: Horizontally (left, right) Vertically (up, down) Diagonally (four directions: up-left, up-right, down-left, down-right) The queen can move any number of squares in any of these directions, but it cannot move through obstacles. Input Format : n : The size of the chessboard ( n x n ). k : The number of obstacles...

Sales by Match HackerRank Solution | Java Solution

HackerRank Sales by Match problem solution in Java   Problem Description : Alex works at a clothing store. There is a large pile of socks that must be paired by color for sale. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are. For example, there are n=7 socks with colors socks = [1,2,1,2,1,3,2]. There is one pair of color 1 and one of color 2 . There are three odd socks left, one of each color. The number of pairs is 2 .   Example 1 : Input : n = 6 arr = [1, 2, 3, 4, 5, 6] Output : 0 Explanation : We have 6 socks with all different colors, So print 0. Example 2 : Input : n = 10 arr = [1, 2, 3, 4, 1, 4, 2, 7, 9, 9] Output : 4 Explanation : We have 10 socks. There is pair of color 1, 2, 4 and 9, So print 4. This problem easily solved by HashMap . Store all pair of socks one by one in Map and check if any pair is present in Map or not. If pair is present then increment ans variable by 1 ...