import java.util.

Scanner;

public class Homework {

public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
// prime nos between 1 to 100
/*
* for (int num = 2; num <= 100; num++) {
* boolean isPrime = true;
* for (int i = 2; i < num / 2; i++) {
* if (num % i == 0) {
* isPrime = false;
* break;
* }
* }
* if (isPrime) {
* System.out.println(num);
* }
*
* }
*/

// sum of nos from 1 to 100 using for loop

/*
* / System.out.println("enter the no");
* int num = sc.nextInt();
* int sum = 0;
* for (int i = 0; i <= num; i++) {
* sum = sum + i;
* }
* System.out.println(sum);
*/
// fibonacci series
/*
* System.out.println("enter the number :");
* int num = sc.nextInt();
* int n1 = 0;
* int n2 = 1;
* int fib = 0;
* System.out.print(n1 + " " + n2 + " ");
* for (int i = 2; i < num; i++) {
*
* fib = n1 + n2;
* n1 = n2;
* n2 = fib;
* System.out.print(fib + " ");
* }
*/

// geometric series
/*
* System.out.println("enter no of terms you want to print : ");
* int num = sc.nextInt();
* System.out.println("enter first term of gp: ");
* double firstTerm = sc.nextDouble();
* System.out.println("enter common ratio of gp : ");
* double commonRatio = sc.nextDouble();
* for (int i = 0; i < num; i++) {
* double result = firstTerm * (double) Math.pow(commonRatio, i);
 * System.out.println(result);
* }
*/

// pattern
/*
* int n = 2;
* for (int i = 1; i <= n; i++) {
* for (int j = 1; j <= i; j++) {
* System.out.print("*");
*
* }
* System.out.println();
* }
*/

// time convertor
System.out.println("enter time");
int time = sc.nextInt();
int hour = (time / 3600);
int minutes = (time / 3600) % 60;
int seconds = (time % 3600) % 60;
System.out.println("converted time is " + hour + "hour " + minutes +
"minutes " + seconds + " seconds");
}

}
//tibonacci series
public static int tibonacci(int num) {
if (num == 0 || num == 1) {
return 0;
}
if (num == 2) {
return 1;
}
return tibonacci(num - 1) + tibonacci(num - 2) + tibonacci(num - 3);
}

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);
System.out.println("enter number");
int num = sc.nextInt();

System.out.println("tibonacci series " + num + "th element is : " +

tibonacci(num));
}
// nth term of fibonacci using recursion
/*
* public static int fibonacci(int num) {
* if (num == 0) {
* return 0;
* }
* if (num == 1) {
* return 1;
* }
* return fibonacci(num - 1) + fibonacci(num - 2);
* }
*/
 // nth term of motzkins numbers sequence
/*
* public static int MotzkinNumber(int num) {
* if (num == 0) {
* return 1;
* }
* if (num == 1) {
* return 1;
* }
* if (num == 2) {
* return 2;
* }
* return ((2 * num + 1) * MotzkinNumber(num - 1)
* + (3 * num - 3) * MotzkinNumber(num - 2)) / (num + 2);
* }
*/
// sum of digits of no
/*
* public static int sumOfDigits(int num) {
* if (num >= 0 && num <= 9) {
* return num;
* }
* int digit = num % 10;
* return digit + sumOfDigits(num / 10);
* }
*/
//factorial
* public static int factorial(int num) {
* if (num == 0 || num == 1) {
* return 1;
* }
* return num * factorial(num - 1);
*
* }
// ackermann function
/* public static int ackerMann(int m, int n) {
if (m == 0) {
return n + 1;
}
if (m > 0 && n == 0) {
return ackerMann(m - 1, 1);
}
if (m > 0 && n > 0) {
return ackerMann(m - 1, ackerMann(m, n - 1));
}
return -1;
}

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);
System.out.println("enter number");
int num1 = sc.nextInt();
int num2 = sc.nextInt();
int k = ackerMann(num1, num2);
System.out.println(k);

}
// jacobstal series
 public static int jacobstalNumber(int num) {
if (num == 0) {
return 0;
}
if (num == 1) {
return 1;
}
return jacobstalNumber(num - 1) + 2 * jacobstalNumber(num - 2);
}

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);
System.out.println("enter number");
int num = sc.nextInt();

System.out.println("jakobsthal number for " + num + "th position is : " +

jacobstalNumber(num));

}
// sum of even numbers in a range
public static int sumOfEven(int start, int end) {
if (start > end) {
return 0;
}
if (start % 2 == 0) {
return start + sumOfEven(start + 2, end);
} else {
return sumOfEven(start + 1, end);
}
}

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);
System.out.println("enter starting number");
int num1 = sc.nextInt();
System.out.println("enter ending number");
int num2 = sc.nextInt();

System.out.println("sum of even nos in this range is : " + sumOfEven(num1,

num2));

}
// pell series
public static int findPellNo(int num) {
if (num == 0) {
return 0;
}
if (num == 1) {
return 1;
}
return 2 * findPellNo(num - 1) + findPellNo(num - 2);
}

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);
System.out.println("enter number");
int num = sc.nextInt();

System.out.println("pell number is : " + findPellNo(num));

 }
// sum of digits of factorial of a given number

public static int factorial(int num) {

if (num == 0 || num == 1) {
return 1;
}
return num * factorial(num - 1);
}

public static int sumOfDigits(int num1) {

if (num1 >= 0 && num1 <= 9) {
return num1;
}
int digit = num1 % 10;
return digit + sumOfDigits(num1 / 10);

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);
System.out.println("enter number");
int num = sc.nextInt();

System.out.println("factorial of number is : " + factorial(num));

System.out.println("sum of digits of factorial is : " +
sumOfDigits(factorial(num)));

}
//reverse a string using append
public static String reverseString(String str) {
StringBuilder stringBuilder = new StringBuilder();

for (int i = str.length() - 1; i >= 0; i--) {

stringBuilder.append(str.charAt(i));
}

return stringBuilder.toString();
}
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("enter a string: ");
String input = scanner.nextLine();

String reversed = reverseString(input);

System.out.println("reversed string: " + reversed);

if (input.equals(reversed)) {
System.out.println("palindrome");
} else {
System.out.println("not a palindrome");
}

}
//check palindrome using two pointer
public static boolean isPalindrome(String str) {
int left = 0;
int right = str.length() - 1;
 while (left < right) {
if (str.charAt(left) != str.charAt(right)) {
return false;
}
left++;
right--;
}
return true;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("enter string : ");
String input = sc.nextLine();
if (isPalindrome(input)) {
System.out.println("strimg is palindrome");
} else {
System.out.println("not a palindrome");
}
}
//count characters of string without counting whitespace
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("enter string");
String str = sc.nextLine();
int count = 0;
for (int i = 0; i < str.length(); i++) {
if (str.charAt(i) != ' ') {
count++;
}
}
System.out.println(count);
}