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

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 ...

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...