Skip to main content

Write a program in Java to check if a character is an uppercase vowel or lowercase vowel or not

Java program to check given alphabet is an uppercase or lowercase vowel or not

Java program to check given alphabet is an uppercase or lowercase vowel or not

In this program, we just have to find given user input character is uppercase or lowercase vowel or not.

We will seen two solution approach for this problem

  1. Using List
  2. Using Switch Case

Example :

Input : 'A'
Output : Character is UpperCase Vowel 

Input : 'e'
Output : Character is LowerCase Vowel

Input : 'j'
Output : Character is Not a Vowel

Solution Approach :

We will use ArrayList for store vowels and check if given character is uppercase or lowercase vowel or not. 

So lets jump on code.

Solution 1 : Using List

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class CheckVowelsCase {

    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);
        System.out.println("Enter Character");
        char ch = sc.next().charAt(0);
        String answer = checkVowels(ch);
        System.out.println(answer);
    }
    
    static String checkVowels(Character ch) {
       
        List<Character> listOfUpperCase = new ArrayList<>() {{
            add('A');
            add('E');
            add('I');
            add('O');
            add('U');
        }};
       
        List<Character> listOfLowerCase = new ArrayList<>() {{
            add('a');
            add('e');
            add('i');
            add('o');
            add('u');
        }};

        if (listOfUpperCase.contains(ch)) {
            return "Character is UpperCase Vowel";
        } else if (listOfLowerCase.contains(ch)) {
            return "Character is LowerCase Vowel";
        }

        return "Character is Not a Vowel";
    }

}

Output :

Enter Character
I
Character is UpperCase Vowel

Enter Character
u
Character is LowerCase Vowel

Enter Character
j
Character is Not a Vowel

Solution Explanation :

  • Created two List, and add all upper case vowels into listOfUpperCase and lower case vowels into listOfLowerCase.
  • Check if List contains given character character or not. 
  • Return answer based on condition.

Solution 2 : Using Switch Case 

import java.util.Scanner;

public class CheckVowelsCase {

    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);
        System.out.println("Enter Character");
        char ch = sc.next().charAt(0);
        String answer = checkVowels(ch);
        System.out.println(answer);
    }
    
    static String checkVowels(Character ch) {
        switch (ch) {
            case 'A':
            case 'E':
            case 'I':
            case 'O':
            case 'U': return "Character is UpperCase Vowel";
            case 'a':
            case 'e':
            case 'i':
            case 'o':
            case 'u': return "Character is LowerCase Vowel";
        }
        return "Character is Not a Vowel";   
    }
}

Other related articles :

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