Tech Jargon - Decoded

import java.util.Scanner;

public class RangeInputValidation {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int number;
        int lowerBound = 10;
        int upperBound = 50;

        do {
            System.out.print("Enter a number between " + lowerBound + " and " + upperBound + ": ");
            number = scanner.nextInt();

            if (number < lowerBound || number > upperBound) {
                System.out.println("Invalid input. Please enter a number within the specified range.");
            }
        } while (number < lowerBound || number > upperBound);

        System.out.println("You entered: " + number);
        scanner.close();
    }
}

Input: 5
Output: Enter a number between 10 and 50:
Invalid input. Please enter a number within the specified range.
Enter a number between 10 and 50:
Input: 60
Output: Invalid input. Please enter a number within the specified range.
Enter a number between 10 and 50:
Input: 30
Output: You entered: 30

import java.util.Scanner;

public class PositiveNumberInput {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int number;

        do {
            System.out.print("Enter a positive number: ");
            number = scanner.nextInt();
            if (number <= 0) {
                System.out.println("Invalid input. Please enter a positive number.");
            }
        } while (number <= 0);

        System.out.println("You entered: " + number);
        scanner.close();
    }
}

Input: -5
Output: Enter a positive number: Invalid input. Please enter a positive number.
Input: 0
Output: Enter a positive number: Invalid input. Please enter a positive number.
Input: 10
Output: Enter a positive number: You entered: 10

import java.util.Random;
import java.util.Scanner;

public class NumberGuessingGame {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        Random random = new Random();
        int randomNumber = random.nextInt(100) + 1; // Generate a random number between 1 and 100
        int guess;
        int numberOfTries = 0;

        do {
            System.out.print("Guess a number between 1 and 100: ");
            guess = sc.nextInt();
            numberOfTries++;

            if (guess < randomNumber) {
                System.out.println("Too low! Try again.");
            } else if (guess > randomNumber) {
                System.out.println("Too high! Try again.");
            } else {
                System.out.println("Congratulations! You guessed the number in " + numberOfTries + " tries.");
            }
        } while (guess != randomNumber);

        sc.close();
    }
}

Guess a number between 1 and 100: Input: 50
Output: Too low! Try again.
Guess a number between 1 and 100: Input: 75
Output: Too high! Try again.
Guess a number between 1 and 100: Input: 63
Output: Too low! Try again.
Guess a number between 1 and 100: Input: 69
Output: Too low! Try again.
Guess a number between 1 and 100: Input: 72
Output: Too low! Try again.
Guess a number between 1 and 100: Input: 74
Output: Too high! Try again.
Guess a number between 1 and 100: Input: 73
Output: Congratulations! You guessed the number in 7 tries.

import java.util.Scanner;

public class MenuDrivenCalculator {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int choice;

        do {
            System.out.println("Menu:");
            System.out.println("1. Addition");
            System.out.println("2. Subtraction");
            System.out.println("3. Multiplication");
            System.out.println("4. Division");
            System.out.println("5. Exit");
            System.out.print("Enter your choice: ");
            choice = scanner.nextInt();

            if (choice >= 1 && choice <= 4) {
                System.out.print("Enter first number: ");
                double num1 = scanner.nextDouble();
                System.out.print("Enter second number: ");
                double num2 = scanner.nextDouble();

                double result = 0;

                switch (choice) {
                    case 1:
                        result = num1 + num2;
                        break;
                    case 2:
                        result = num1 - num2;
                        break;
                    case 3:
                        result = num1 * num2;
                        break;
                    case 4:
                         if (num2 != 0) {
                            result = num1 / num2;
                         } else {
                            System.out.println("Cannot divide by zero!");
                            continue; // Go to the next iteration of the loop
                         }
                        break;
                }

                System.out.println("Result: " + result);
            } else if (choice != 5) {
                System.out.println("Invalid choice. Please enter a number between 1 and 5.");
            }

        } while (choice != 5);

        System.out.println("Exiting Calculator. Dhanyavaad!");
        scanner.close();
    }
}

Menu:
1. Addition
2. Subtraction
3. Multiplication
4. Division
5. Exit
Enter your choice: Input: 1
Enter first number: Input: 10
Enter second number: Input: 5
Output: Result: 15.0
Menu:
1. Addition
2. Subtraction
3. Multiplication
4. Division
5. Exit
Enter your choice: Input: 2
Enter first number: Input: 10
Enter second number: Input: 5
Output: Result: 5.0
Menu:
1. Addition
2. Subtraction
3. Multiplication
4. Division
5. Exit
Enter your choice: Input: 3
Enter first number: Input: 10
Enter second number: Input: 5
Output: Result: 50.0
Menu:
1. Addition
2. Subtraction
3. Multiplication
4. Division
5. Exit
Enter your choice: Input: 4
Enter first number: Input: 10
Enter second number: Input: 5
Output: Result: 2.0
Menu:
1. Addition
2. Subtraction
3. Multiplication
4. Division
5. Exit
Enter your choice: Input: 4
Enter first number: Input: 10
Enter second number: Input: 0
Cannot divide by zero!
Menu:
1. Addition
2. Subtraction
3. Multiplication
4. Division
5. Exit
Enter your choice: Input: 6
Invalid choice. Please enter a number between 1 and 5.
Menu:
1. Addition
2. Subtraction
3. Multiplication
4. Division
5. Exit
Enter your choice: Input: 5
Exiting Calculator. Dhanyavaad!

import java.util.Scanner;

public class PowerOfNumber {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        System.out.print("Enter the base number: ");
        int base = scanner.nextInt();

        System.out.print("Enter the exponent: ");
        int exponent = scanner.nextInt();

        long result = 1;

        for (int i = 0; i < exponent; i++) {
            result *= base;
        }

        System.out.println("The result is: " + result);

        scanner.close();
    }
}

Input: 2
Input: 10
Output: The result is: 1024

Input: 3
Input: 4
Output: The result is: 81

Input: 5
Input: 0
Output: The result is: 1

Input: -2
Input: 3
Output: The result is: -8

import java.util.Scanner;

public class LcmOfTwoNumbers {

    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);

        System.out.print("Enter first number: ");
        int num1 = input.nextInt();

        System.out.print("Enter second number: ");
        int num2 = input.nextInt();

        int lcm = 1;
        // Find the greater number between num1 and num2
        int greater = Math.max(num1, num2);

        for (int i = greater; ; i++) {
            if (i % num1 == 0 && i % num2 == 0) {
                lcm = i;
                break; // Exit the loop once LCM is found
            }
        }

        System.out.println("LCM of " + num1 + " and " + num2 + " is: " + lcm);

        input.close();
    }
}

Input: 12
Input: 18
Output: Enter first number: Enter second number: LCM of 12 and 18 is: 36

import java.util.Scanner;

public class DiamondPattern {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.print("Enter the number of rows: ");
        int numberOfRows = scanner.nextInt();

        // Upper half of the diamond
        for (int i = 1; i <= numberOfRows; i++) {
            // Print spaces
            for (int j = numberOfRows - i; j > 0; j--) {
                System.out.print(" ");
            }
            // Print stars
            for (int k = 1; k <= (2 * i - 1); k++) {
                System.out.print("*");
            }
            System.out.println();
        }

        // Lower half of the diamond
        for (int i = numberOfRows - 1; i >= 1; i--) {
            // Print spaces
            for (int j = numberOfRows - i; j > 0; j--) {
                System.out.print(" ");
            }
            // Print stars
            for (int k = 1; k <= (2 * i - 1); k++) {
                System.out.print("*");
            }
            System.out.println();
        }

        scanner.close();
    }
}

Input: 5
Output: Enter the number of rows:     *
    ***
   *****
  *******
 *********
  *******
   *****
    ***
     *

import java.util.Scanner;

public class PyramidPattern {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        System.out.print("Enter the number of rows for the pyramid: ");
        int numberOfRows = scanner.nextInt();

        for (int i = 1; i <= numberOfRows; i++) {
            // Print spaces before the stars
            for (int j = 1; j <= numberOfRows - i; j++) {
                System.out.print("  ");
            }

            // Print stars
            for (int k = 1; k <= 2 * i - 1; k++) {
                System.out.print("* ");
            }

            // Move to the next line after each row
            System.out.println();
        }

        scanner.close();
    }
}

Input: 5
Output:
Enter the number of rows for the pyramid:         *
       * * *
     * * * * *
   * * * * * * *
 * * * * * * * * *

import java.util.Scanner;

public class InvertedRightTrianglePattern {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        System.out.print("Enter the number of rows: ");
        int numberOfRows = scanner.nextInt();

        for (int i = numberOfRows; i >= 1; i--) {
            for (int j = 1; j <= i; j++) {
                System.out.print("*");
            }
            System.out.println();
        }

        scanner.close();
    }
}

Input: 5
Output: Enter the number of rows: *****
****
***
**
*

import java.util.Scanner;

public class RightTrianglePattern {

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);

        System.out.print("Enter the number of rows: ");
        int numberOfRows = scanner.nextInt();

        // Outer loop for rows
        for (int i = 1; i <= numberOfRows; i++) {
            // Inner loop for columns (printing stars)
            for (int j = 1; j <= i; j++) {
                System.out.print("* ");
            }
            // Move to the next line after each row
            System.out.println();
        }

        scanner.close();
    }
}

Input: 5
Output: Enter the number of rows: *
* *
* * *
* * * *
* * * * *

import java.util.Scanner;

public class FindFactors {

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);

        System.out.print("Enter a number: ");
        int number = scanner.nextInt();

        System.out.print("Factors of " + number + " are: ");

        for (int i = 1; i <= number; i++) {
            if (number % i == 0) {
                System.out.print(i + " ");
            }
        }

        System.out.println();

        scanner.close();
    }
}

Input: 10
Output: Enter a number: Factors of 10 are: 1 2 5 10

Input: 21
Output: Enter a number: Factors of 21 are: 1 3 7 21

Input: 1
Output: Enter a number: Factors of 1 are: 1

Input: 16
Output: Enter a number: Factors of 16 are: 1 2 4 8 16

import java.util.Scanner;

public class PrimeNumberChecker {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        System.out.print("Enter a number to check if it's prime: ");
        int number = scanner.nextInt();

        boolean isPrime = true;

        if (number <= 1) {
            isPrime = false;
        } else {
            for (int i = 2; i <= Math.sqrt(number); i++) {
                if (number % i == 0) {
                    isPrime = false;
                    break; // No need to continue checking if divisible
                }
            }
        }

        if (isPrime) {
            System.out.println(number + " is a prime number.");
        } else {
            System.out.println(number + " is not a prime number.");
        }

        scanner.close();
    }
}

Input: 7
Output: Enter a number to check if it's prime: 7 is a prime number.

Input: 10
Output: Enter a number to check if it's prime: 10 is not a prime number.

Input: 1
Output: Enter a number to check if it's prime: 1 is not a prime number.

Input: 2
Output: Enter a number to check if it's prime: 2 is a prime number.

Input: 0
Output: Enter a number to check if it's prime: 0 is not a prime number.

import java.util.Scanner;

public class PrimeNumbersInRange {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        System.out.print("Enter the starting number: ");
        int start = scanner.nextInt();

        System.out.print("Enter the ending number: ");
        int end = scanner.nextInt();

        System.out.println("Prime numbers between " + start + " and " + end + " are:");

        for (int number = start; number <= end; number++) {
            if (isPrime(number)) {
                System.out.print(number + " ");
            }
        }
        System.out.println();

        scanner.close();
    }

    public static boolean isPrime(int number) {
        if (number <= 1) {
            return false;
        }
        for (int i = 2; i <= Math.sqrt(number); i++) {
            if (number % i == 0) {
                return false;
            }
        }
        return true;
    }
}

Input: 10
Input: 20
Output: Enter the starting number: Enter the ending number: Prime numbers between 10 and 20 are:
11 13 17 19
Input: 1
Input: 10
Output: Enter the starting number: Enter the ending number: Prime numbers between 1 and 10 are:
2 3 5 7
Input: 20
Input: 30
Output: Enter the starting number: Enter the ending number: Prime numbers between 20 and 30 are:
23 29

import java.util.Scanner;

public class FibonacciSeriesUpToNTerms {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.print("Enter the number of terms: ");
        int numberOfTerms = scanner.nextInt();

        int firstTerm = 0;
        int secondTerm = 1;

        System.out.print("Fibonacci Series up to " + numberOfTerms + " terms: ");

        for (int i = 1; i <= numberOfTerms; ++i) {
            System.out.print(firstTerm + " ");

            int nextTerm = firstTerm + secondTerm;
            firstTerm = secondTerm;
            secondTerm = nextTerm;
        }
        System.out.println();
        scanner.close();
    }
}

Input: 10
Output: Enter the number of terms: Fibonacci Series up to 10 terms: 0 1 1 2 3 5 8 13 21 34

import java.util.Scanner;

public class StrongNumbersInRange {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        System.out.print("Enter the starting number of the range: ");
        int startRange = scanner.nextInt();

        System.out.print("Enter the ending number of the range: ");
        int endRange = scanner.nextInt();

        System.out.println("Strong numbers in the range " + startRange + " to " + endRange + " are:");

        for (int i = startRange; i <= endRange; i++) {
            if (isStrongNumber(i)) {
                System.out.print(i + " ");
            }
        }

        System.out.println();
        scanner.close();
    }

    static boolean isStrongNumber(int num) {
        int originalNum = num;
        int sum = 0;

        while (num > 0) {
            int digit = num % 10;
            sum += factorial(digit);
            num /= 10;
        }

        return sum == originalNum;
    }

    static int factorial(int n) {
        int fact = 1;
        for (int i = 1; i <= n; i++) {
            fact *= i;
        }
        return fact;
    }
}

Input: 1
Input: 150
Output: Enter the starting number of the range: Enter the ending number of the range: Strong numbers in the range 1 to 150 are:
1 2 145

import java.util.Scanner;

public class PerfectNumbersInRange {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        System.out.print("Enter the starting number of the range: ");
        int start = scanner.nextInt();

        System.out.print("Enter the ending number of the range: ");
        int end = scanner.nextInt();

        System.out.println("Perfect numbers in the range " + start + " to " + end + " are:");

        for (int i = start; i <= end; i++) {
            if (isPerfectNumber(i)) {
                System.out.print(i + " ");
            }
        }
        System.out.println(); // Add a newline at the end

        scanner.close();
    }

    public static boolean isPerfectNumber(int number) {
        if (number <= 1) {
            return false;
        }

        int sum = 1; // Start with 1, as 1 is always a divisor

        for (int i = 2; i * i <= number; i++) {
            if (number % i == 0) {
                sum += i;
                if (i * i != number) { // Avoid adding the square root twice
                    sum += number / i;
                }
            }
        }

        return sum == number;
    }
}

Input: 1
Input: 30
Output:
Enter the starting number of the range: Enter the ending number of the range: Perfect numbers in the range 1 to 30 are:
6 28
Input: 20
Input: 50
Output:
Enter the starting number of the range: Enter the ending number of the range: Perfect numbers in the range 20 to 50 are:
28
Input: 1
Input: 10
Output:
Enter the starting number of the range: Enter the ending number of the range: Perfect numbers in the range 1 to 10 are:
6

import java.util.Scanner;

public class ArmstrongNumbersInRange {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        System.out.print("Enter the starting number of the range: ");
        int start = scanner.nextInt();

        System.out.print("Enter the ending number of the range: ");
        int end = scanner.nextInt();

        System.out.println("Armstrong numbers in the range " + start + " to " + end + " are:");

        for (int number = start; number <= end; number++) {
            if (isArmstrong(number)) {
                System.out.print(number + " ");
            }
        }
        System.out.println(); // Add a newline at the end

        scanner.close();
    }

    static boolean isArmstrong(int number) {
        int originalNumber = number;
        int sum = 0;
        int numberOfDigits = String.valueOf(number).length();

        while (number > 0) {
            int digit = number % 10;
            sum += Math.pow(digit, numberOfDigits);
            number /= 10;
        }

        return sum == originalNumber;
    }
}

Input: 150
Input: 160
Output: Armstrong numbers in the range 150 to 160 are:
153
Input: 0
Input: 1000
Output: Armstrong numbers in the range 0 to 1000 are:
0 1 2 3 4 5 6 7 8 9 153 370 371 407
Input: 9474
Input: 9474
Output: Armstrong numbers in the range 9474 to 9474 are:
9474
Input: 1634
Input: 1634
Output: Armstrong numbers in the range 1634 to 1634 are:
1634
Input: 8208
Input: 8208
Output: Armstrong numbers in the range 8208 to 8208 are:
8208
Input: 1
Input: 10
Output: Armstrong numbers in the range 1 to 10 are:
1 2 3 4 5 6 7 8 9
Input: 100
Input: 500
Output: Armstrong numbers in the range 100 to 500 are:
153 370 371 407

import java.util.Scanner;

public class ArmstrongNumberChecker {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        System.out.print("Enter a number: ");
        int number = scanner.nextInt();

        int originalNumber = number;
        int sum = 0;
        int numberOfDigits = String.valueOf(number).length(); // find number of digits

        while (number > 0) {
            int digit = number % 10;
            sum += Math.pow(digit, numberOfDigits);
            number /= 10;
        }

        if (sum == originalNumber) {
            System.out.println(originalNumber + " is an Armstrong number.");
        } else {
            System.out.println(originalNumber + " is not an Armstrong number.");
        }

        scanner.close();
    }
}

Input: 153
Output: 153 is an Armstrong number.

Input: 120
Output: 120 is not an Armstrong number.

Input: 370
Output: 370 is an Armstrong number.

Input: 371
Output: 371 is an Armstrong number.

Input: 407
Output: 407 is an Armstrong number.

Input: 1634
Output: 1634 is an Armstrong number.

Input: 8208
Output: 8208 is an Armstrong number.

Input: 54748
Output: 54748 is not an Armstrong number.

import java.util.Scanner;

public class PalindromeNumberCheckerFor {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.print("Enter a number: ");
        int number = scanner.nextInt();
        int originalNumber = number;
        int reversedNumber = 0;

        for (;number != 0; number /= 10) {
            int remainder = number % 10;
            reversedNumber = reversedNumber * 10 + remainder;
        }

        if (originalNumber == reversedNumber) {
            System.out.println(originalNumber + " is a palindrome.");
        } else {
            System.out.println(originalNumber + " is not a palindrome.");
        }

        scanner.close();
    }
}

Input: 121
Output: Enter a number: 121 is a palindrome.

Input: 123
Output: Enter a number: 123 is not a palindrome.

Input: 12321
Output: Enter a number: 12321 is a palindrome.

Input: 12345
Output: Enter a number: 12345 is not a palindrome.

Input: 0
Output: Enter a number: 0 is a palindrome.