import java.util.*;

public class quest3 {
    // Write a Java program to check if a number is a palindrome in Java? ( 121 is a
    // palindrome,321 is not) A number is called a palindrome if the number is equal
    // to the reverse of a number e.g.,121 is a palindrome because the reverse of
    // 121 is 121 itself. On the other hand,321 is not a palindrome because the
    // reverse of 321 is 123, which is not equal to 321
    public static void isPalindrome(int num) {
        int orignalnum = num;
        int palindrome = 0;
        while (num > 0) {
            int remind = num % 10;
            num = num / 10;
            palindrome = palindrome * 10 + remind;

        }

        System.out.print(palindrome == orignalnum);

    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter any number: ");
        int num = sc.nextInt();
        isPalindrome(num);

    }
}

******
*****
****
***
**
*

 

public class pattern1 {

    public static void reverseStar(int n) {
        // reverse pattern
        for (int i = n; i >= 0; i--) {
            for (int j = 1; j <= i; j++) {
                System.out.print("*");

            }
            System.out.println();

        }

    }

    public static void main(String[] args) {
        reverseStar(6);

    }

}

public class Hollowrect {
    public static void HollowrectPattern(int noOfRows, int noOfCols) {
        // for rows outer loop
        for (int i = 1; i <= noOfRows; i++) {
            // inner loop
            for (int j = 1; j <= noOfCols; j++) {
                // cell (i,j)
                if (i == 1 || i == noOfRows || j == 1 || j == noOfCols) {
                    System.out.print("*");

                } else {
                    System.out.print(" ");
                }

            }
            System.out.println();

        }

    }

    public static void main(String[] args) {
        HollowrectPattern(4, 7);

    }
}

*******
*     *
*     *
*******

public class invertrothalfpyramid {
    

    public static void inverted_half_pyramid(int n) {
        // outer loop
        for (int i = 1; i <= n; i++) {
            // empty space
            for (int j = 1; j <= n - i; j++) {
                System.out.print(" ");

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

            }
            System.out.println();

        }

    }

    public static void main(String[] args) {
        // InvertedHalfPiramid(4, 4);
        inverted_half_pyramid(4);

    }
}

   *
  **
 ***
****

public class invertedpyra {
    public static void Inverted_half_pyramid(int n) {
        for (int i = 1; i <= n; i++) {
            // inner loop

            for (int j = 1; j <= n - i + 1; j++) {
                System.out.print(j);

            }
            System.out.println();
        }
    }
    public static void main(String[] args) {
        Inverted_half_pyramid(6);
    }
}

123456       
12345
1234
123
12
1

public class floydtriangle {
    public static void floyd(int n) {
        int count = 1;
        for (int i = 1; i <= n; i++) {

            for (int j = 1; j <= i; j++) {

                System.out.print(count + " ");
                count++;
            }
            System.out.println();
        }
    }

    public static void main(String[] args) {
        floyd(5);

    }
}

1 
2 3
4 5 6
7 8 9 10
11 12 13 14 15

public class zeroone {
    public static void zeroOne_Triangle(int n) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= i; j++) {
                if ((i + j) % 2 == 0) {
                    System.out.print("1 ");

                } else {
                    System.out.print("0 ");

                }

            }
            System.out.println();

        }

    }

    public static void main(String[] args) {
        zeroOne_Triangle(5);

    }
}

1 
0 1
1 0 1
0 1 0 1
1 0 1 0 1

public class Butterflypattern {
    public static void butterfly_pattern(int n) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= i; j++) {
                System.out.print("*");

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

            }
            for (int index = 1; index <= i; index++) {
                System.out.print("*");

            }
            System.out.println();

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

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

            }
            for (int index = 1; index <= i; index++) {
                System.out.print("*");

            }
            System.out.println();

        }

    }

    public static void main(String[] args) {
        butterfly_pattern(5);

    }
}

*        *
**      **
***    ***
****  ****
**********
**********
****  ****
***    ***
**      **
*        *