Solution Maker

 Check String contains only Digit's           Get the input from the user using Scanner class. Then create a method to check the following condition. 1. Check if the string is null or empty, if it is directly return false. 2. Iterate the String using for loop inside the for loop, use the if for condition checking. 3. Condition is check the Digit's only, for this use the Character Wrapper class, in that we have isDigit() method to check the Digit's. 4. This method will return true or false based on it is Digit's or not. Code : package com.dinatechy.challange; import java.util.Scanner; public class CheckDigitsOnly { public static void main(String[] args ) { //To check if the String contains only Digit's Scanner scan = new Scanner(System. in ); String data = scan .next(); scan .close(); boolean isDigits = checkDigits ( data ); System. out .println( isDigits ? "Yes it is" : "No it's not" ); } privat...

 Checking if the String contains Character only     Get the input from the user using Scanner class. Then create a method to check the following condition. 1. Check if the string is null or empty, if it is directly return false. 2. Iterate the String using for loop inside the for loop, use the if for condition checking. 3. Condition is check the Character only, for this use the Character Wrapper class, in that we have  isAlphabetic() method to check the character. 4. This method will return true or false based on it is character or not. Code: package com.dinatechy.challange; import java.util.Scanner; public class CheckCharacter { public static void main(String[] args ) { //Check the String only contains Character or Not Scanner scan = new Scanner(System. in ); System. out .print( "Enter the String : " ); String data = scan .next(); scan .close(); boolean isChar = checkOnlyCharacter ( data ); System. out .println( isChar ? "Yes...

 Finding GCD of Two Number     First we need to modules the first number by second number, then store the output in second number.     Before doing the modules store the second number value for next iteration in temp variable. And do the process still the second number becomes zero. Code : package com.dinatechy.challange; import java.util.Scanner; public class GCDofNumber { public static void main(String[] args ) { Scanner scanner = new Scanner(System. in ); System. out .print( "Enter the first number: " ); int num1 = scanner .nextInt(); System. out .print( "Enter the second number: " ); int num2 = scanner .nextInt(); scanner .close(); // Calculate the GCD int gcd = findGCD ( num1 , num2 ); // Print the result System. out .println( "The GCD of " + num1 + " and " + num2 + " is: " + gcd ); } // Method to find the GCD usi...

 Check the number is Prime                    First we need to check whether the number is 1 or 0, if it is straight away you can say it is Prime Number.                    Next we need to divide the number by 2, because if we couldn't divide a number by more than half of a number.                    Final Thing is start the for loop and inside for loop modules the given number by loop variable, if the remainder is zero it is not Prime, if not it is Prime Number. Code :  package com.dinatechy.challange; import java.util.Scanner; public class PrimeNumber { public static void main(String[] args ) { //Check if the given number is Prime or not Scanner scan = new Scanner(System. in ); int number = scan .nextInt(); scan .close(); boolean result = isPrime ( number ); System. out .pri...

 Counting Vowels in a String          We have two String's, one has the value we need to check and another has a vowels.  1. First we need a for loop for iteration of the given String. 2. Second for the condition end value is String's length, so to achieve Time Complexity we are storing the size of the String in one variable. 3. Next step as inside the for loop take the each character from the string and check if that character is in the vowels string. 4. If the condition is true increase the count values as one using post increment operator. If not doesn't do anything move to next iteration. Code : package com.dinatechy.challange; public class CountVowels { public static void main(String[] args ) { //Count number of Vowels - a e i o u String value = "DinaTechy" ; // vowels = 3 String vowels = "aeiou" ; int count = 0; int size = value .length(); for ( int i =0; i < size ; i ++) { if ( vowels .contains(String. ...

 Instagram Follow Button Code :  <! DOCTYPE html > < html lang = "en" > < head >     < meta charset = "UTF-8" >     < meta name = "viewport" content = "width=device-width, initial-scale=1.0" >     < title > Document </ title >     < style >         .follow-btn {             background-color : rgb ( 33 , 125 , 218 );             border : none ;             border-radius : 4px ;             padding : 5px 12px ;             color : white ;             margin : 0 30% ;             font-weight : bold ;             letter-spacing : 1px ;         }     </ style > </ head > < body >  ...

Subscribe Button Styles Code :  <! DOCTYPE html > < html lang = "en" > < head >     < meta charset = "UTF-8" >     < meta name = "viewport" content = "width=device-width, initial-scale=1.0" >     < title > Document </ title >     < style >         .subscribe {             display : flex ;             align-items : center ;             gap : 0.5rem ;             background-color : rgb ( 229 , 231 , 234 );             padding : 0 6px ;             width : 120px ;             border-radius : 16px ;             margin : 0 30% ;         }     </ style > </ head > < body >     < ...

 Finding Second largest Number in Array :           1. First we need two variable called largest and second-largest. As next step, we need to use for-each loop to get the elements one by one.           2. Then as first condition is check whether value from the array is greater than largest.            3. If it is store the largest value into second-largest and value from the array into largest.            4. If not check another condition as value from the array is greater than second-largest and not equal to largest.            5. If this condition is true, store the value from the array into second-largest, is this if the second-largest value is value of last before(that is array.length-2 location).            6. It that condition also false do nothing, continue to next iteration. Co...

  Serialization :         It is a process of converting Object into Stream (Sequence of data flow).         To implement Serialization, we first need to inherit the Serializable interface into the class where we want Serialization. Here, is the example : Next thing is to start the process of Data Transfer :  Thanks for reaching out Guys, if you any doubts or errors kindly let me know in the comments .