Solution Maker

Regex Pattern Program for Validating Length           Here we are going to check whether the given String has only certain number length using the Regex Pattern matching logic in Java. The steps are Logical Theory : Check for Length: Ensure the number has exactly 10 digits. Regex Pattern for Validation :      1. Regex: ^.{10}$      2. Explanation:               ^ asserts the start of the string.               .{10} matches exact length10.               $ asserts the end of the string. Code : package com.dinatechy.challange; import java.util.regex.Matcher; import java.util.regex.Pattern; public class LenghtPattern { public static void main(String[] args ) { // Pattern for validate length String content = "DinaTechy" ; // length - 9 Pattern pattern = Pattern. compile ( "^.{9}$" ); Matcher matcher ...

 Regex Pattern for Mobile Number     Here we are going to check whether the given String is contain mobile number or not using the Regex Pattern matching logic in Java. The steps are Logical Theory : Check for Length : Ensure the number has exactly 10 digits (or more if including a country code). Check for Digits : Ensure that all characters are numeric. Regex Pattern for Validation : Regex: ^\d{10}$ Explanation: ^ asserts the start of the string. \d{10} matches exactly 10 digits. $ asserts the end of the string. Code : package com.dinatechy.challange; import java.util.regex.Matcher; import java.util.regex.Pattern; public class MobileNoPattern { public static void main(String[] args ) { // Mobile number Pattern // length should be 10 // must be digits String mobileNo = "9876543210" ; Pattern pattern = Pattern. compile ( "^\\d{10}$" ); // d refers to only digit's // 10 length Matcher matcher = pattern .matcher( mobileN...

 Finding Triangle with Three length          We are going to find which Triangle's side this are using Java. 1. We are check three Triangle, which is  Equilateral, Isosceles and Scalene. 2. First we need to know the Mathmetical logic for all this,      Equilateral ==> all the three length's are equal.      Isosceles ==> either two side's are equal      Scalene ==> all three side's are different 3. Final part is we need to implement this in code. Code :  package com.dinatechy.challange; public class FindWhichTriangle { public static void main(String[] args ) { // Find the Which Triangle based on the given Three length's // Equilateral == all the three lenght's are equal, // Isosceles == either two side's are equal or // Scalene == all three side's are different int a = 23, b = 231, c = 232; if ( a == b && b == c && c == a ) Syste...

 Pattern Matching Logic               First thing we need to know the content we are going to do the matching and the pattern. 1. Create a reference for Pattern class and then Call the Pattern class static method compile method and send the parameter as pattern you want to search for. 2. Create reference for Matcher and assign the method which is Pattern class method matcher, here send the parameter as content we need to check. 3. Finally call the find method in Matcher class to check the pattern is matched or not. If the method is return true the pattern is matched, if the method return false the pattern is not matched. Code :  package com.dinatechy.challange; import java.util.regex.Matcher; import java.util.regex.Pattern; public class PatternMatching { public static void main(String[] args ) { // Pattern Matching in Java // Example : content = "Hello people hi ", pattern = " hi " // Regex String content = ...

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