Merge pull request #1065 from TANISHA3665/main

Create Palindrome_Number_Java.java

Author: akgmage

Arrays/find_three_largest_numbers.java

@@ -0,0 +1,36 @@
+/*
+
+Problem Statement :
+
+Write a function that takes in an array of at least three integers and, without sorting the input array, returns a sorted array of the three largest integers in the input array.
+
+Explanation:
+
+Here's how the function works:
+
+1. We create a new array result with three elements to store the three largest integers.
+2. We loop through the input array, and for each integer, we compare it to the largest integer in result.
+3. If the integer is larger than the largest integer in result, we shift the elements in result down one position and add the integer to the end.
+4. If the integer is larger than the second largest integer in result, we shift the elements in result down one position starting from the second position and add the integer to the second position.
+5. If the integer is larger than the third largest integer in result, we add the integer to the third position.
+6. At the end of the loop, result will contain the three largest integers in the input array, sorted in descending order. 
+
+*/
+
+public static int[] findThreeLargest(int[] array) {
+    int[] result = new int[3];
+    for (int num : array) {
+        if (num > result[2]) {
+            result[0] = result[1];
+            result[1] = result[2];
+            result[2] = num;
+        } else if (num > result[1]) {
+            result[0] = result[1];
+            result[1] = num;
+        } else if (num > result[0]) {
+            result[0] = num;
+        }
+    }
+    return result;
+}
+

Math/Palindrome_Number_Java.java

@@ -0,0 +1,48 @@
+/* Question : Given an integer x, return true if x is a palindrome, and false otherwise.
+
+Example 1:
+
+Input: x = 121
+Output: true
+Explanation: 121 reads as 121 from left to right and from right to left.
+Example 2:
+
+Input: x = -121
+Output: false
+Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.
+Example 3:
+
+Input: x = 10
+Output: false
+Explanation: Reads 01 from right to left. Therefore it is not a palindrome.
+ 
+
+Constraints:
+
+-231 <= x <= 231 - 1 */
+
+class Solution {
+    public boolean isPalindrome(int x) {
+        if(x < 0){
+            return false;
+        }
+      
+        //Checking if the number is equal to its reverse, if true, it is a palindrome
+        return x == rev(x);
+    }
+  
+  
+    // Function to find reverse of a number
+  
+    public int reverse(int n){
+        int reverse = 0;
+        while(n != 0){
+            int digit = n % 10;
+            rev = digit + reverse * 10;
+            n /= 10;
+        }
+        
+        return reverse;
+    }
+}
+