Added my Day 4 Java code

day4/Java/VowelsInAString.java

@@ -0,0 +1,25 @@
+/* @date 13/10/2020
+ * @author Shashwat Gupta (shashwatxdevelop)
+ */
+import java.util.Scanner;
+public class VowelsInAString {
+
+	public static void main(String[] args) {
+		String s; int k = 0, l, i; char ch = 0;
+		Scanner sc = new Scanner (System.in);
+		System.out.println("Enter the string");
+        s = sc.nextLine();     //taking input as string
+        l = s.length();        //finding length of the string
+        for (i=0; i<l; i++)
+        {
+        	ch= s.charAt(i); //extracting the character from the string
+        	if(ch=='a' || ch == 'A' || ch == 'e' || ch=='E' || ch=='i' || ch=='I' || ch=='o' || ch== 'O'|| ch=='u' || ch=='U')
+        	{
+        		k++; //increasing the counter variable by 1 if vowel is found
+        	}
+
+        }
+        System.out.println("Number of vowels in the string is " + k); //printing the total number of vowels in the string
+	}
+
+}

day4/README.md

@@ -888,9 +888,34 @@ str = gets
 str.chomp!
 puts "The most frequent character in #{str} is : #{most_frequent_character(str)}"
 ```
+/* @date 13/10/2020
+ * @author Shashwat Gupta (shashwatxdevelop)
+ */
+import java.util.Scanner;
+public class VowelsInAString {
+
+	public static void main(String[] args) {
+		String s; int k = 0, l, i; char ch = 0;
+		Scanner sc = new Scanner (System.in);
+		System.out.println("Enter the string");
+        s = sc.nextLine();     //taking input as string
+        l = s.length();        //finding length of the string
+        for (i=0; i<l; i++)
+        {
+        	ch= s.charAt(i); //extracting the character from the string
+        	if(ch=='a' || ch == 'A' || ch == 'e' || ch=='E' || ch=='i' || ch=='I' || ch=='o' || ch== 'O'|| ch=='u' || ch=='U')
+        	{
+        		k++; //increasing the counter variable by 1 if vowel is found
+        	}
+
+        }
+        System.out.println("Number of vowels in the string is " + k); //printing the total number of vowels in the string
+	}
 
+}
+```
 ### Have Another solution?
 
 The beauty of programming lies in the fact that there is never a single solution to any problem.
 
-In case you have an alternative way to solve this problem, do contribute to this repository (https://github.com/CodeToExpress/dailycodebase) :)
+In case you have an alternative way to solve this problem, do contribute to this repository (https://github.com/CodeToExpress/dailycodebase) :)