// Java program to check whether a string is a Palindrome
import java.util.*;
public class Main
{
   public static void main(String args[])
   {
       String str1, str2 = "";
       Scanner sc = new Scanner(System.in);
       System.out.print("Enter the string: ");
       str1 = sc.nextLine();
       int n = str1.length();
       for(int i = n - 1; i >= 0; i--)
       {
           str2 = str2 + str1.charAt(i);
       }
       if(str1.equalsIgnoreCase(str2))
       {
           System.out.println("\nThe string is a palindrome.");
       }
       else
       {
           System.out.println("The string is not a palindrome.");
       }
   }
}

Enter the string: Radar
The string is a palindrome.

Enter the string: Scaler
The string is not a palindrome.

#include <stdio.h>
int main()
{
   int num1, num2;
   printf("Enter two integers: ");
   scanf("%d %d",&num1,&num2);
   // When a negative number is entered, its sign is turned into a positive
   num1 = ( num1 > 0) ? num1 : -num1;
   num2 = ( num2 > 0) ? num2 : -num2;
   while(num1!=num2)
   {
       if(num1 > num2)
           num1 -= num2;
       else
           num2 -= num1;
   }
   printf("GCD = %d", num1);
   return 0;
}

Enter two integers: 27
-34
GCD = 1

import java.io.*;
import java.util.*;
import java.lang.Math;
class Main
{     
   // Returns the pair with a sum close to n
   static void closestSum(int arr[], int l, int n)
   {
       //Used to store result pair indexes
       int resleft=0, resright=0;          
       int leftin = 0, rightin = l-1, diff = Integer.MAX_VALUE;
       while (rightin > leftin)
       {
           if (Math.abs(arr[leftin] + arr[rightin] - n) < diff)
           {
              resleft = leftin;
              resright = rightin;
              diff = Math.abs(arr[leftin] + arr[rightin] - n);
           }
 
             if (arr[leftin] + arr[rightin] > n)
              rightin--;
           else
              leftin++;
       }
      System.out.println("\nThe closest pair is "+arr[resleft]+" and "+ arr[resright] + ".");
   }
         
   // Driver Code
   public static void main(String[] args)
   {
       Scanner sc=new Scanner(System.in);
       System.out.println("Enter number of elements in the sorted array: ");
       int l= sc.nextInt();
       System.out.println("\nEnter elements of the array: ");  
       int[] arr = new int[5];  
       for (int i = 0 ; i < l; i++ )
       {
           arr[i]= sc.nextInt();    
       }
     System.out.println("\nEnter the element for which you want to find the closest sum of pairs: ");
       int n = sc.nextInt();
       closestSum(arr, l, n);       
   }
}

Enter number of elements in the sorted array:
5
Enter elements of the array:
12
24
31
29
16
Enter the element for which you want to find the closest sum of pairs:
60
The closest pair is 31 and 16.

import java.util.*;
class Main 
{
 //l=low and h=high
 static int binarySearch(int a[], int item, int l, int h)       
 {
   if (l >= h) 
   {
     return (item > a[l]) ? (l+ 1) : l;
   } 
  
   int mid = (l + h) / 2; 
   if (item == a[mid])
     return mid + 1;

   if (item > a[mid])
     return binarySearch(a, item, mid + 1, h);

   return binarySearch(a, item, l, mid - 1);
 }

 // Print the median of an array of integers
 static void Median(int a[], int n)
 {
   int i, j, position, num;
   int count = 1; 
   System.out.println("\nAs of reading element 1, the median is " + a[0]); 
   for (i = 1; i < n; i++) 
   {
     float median;
     j = i - 1;
     num = a[i];
     position = binarySearch(a, num, 0, j);

     while (j >= position) 
     {
       a[j + 1] = a[j];
       j--;
     }

     a[j + 1] = num;
     count++;

     if (count % 2 != 0) 
     {
       median = a[count / 2];
     }
     else 
     {
       median = (a[(count / 2) - 1] + a[count / 2]) / 2;
     }
   System.out.println("As of reading element " + (i + 1) + ", the median is " + (int)median);
   }
 }
 
 // Driver code
 public static void main (String[] args) 
 {
       Scanner sc=new Scanner(System.in); 
       System.out.println("Enter number of elements in the array: "); 
       int n= sc.nextInt(); 
       System.out.println("\nEnter elements of the array: ");  
       int[] a = new int[5];  
       for (int i = 0 ; i < n; i++ )
       {
           a[i]= sc.nextInt();    
       } 
   Median(a, n);
 }
}

Enter number of elements in the array:
5
Enter elements of the array:
5
10
3
8
12
As of reading element 1, the median is 5
As of reading element 2, the median is 7
As of reading element 3, the median is 5
As of reading element 4, the median is 6
As of reading element 5, the median is 8

import java.util.*;
class Main
{
 public static void main(String[] args)
{
   String s1 = "Secure";
   String s2 = "Rescue";
   
   s1 = s1.toLowerCase();
   s2 = s2.toLowerCase();
   // Check if lengths are the same
   if(s1.length() == s2.length()) {
     // convert strings to char array
     char[] arr1 = s1.toCharArray();
     char[] arr2 = s2.toCharArray();
     // sort the array
     Arrays.sort(arr1);
     Arrays.sort(arr2);
     // If two sorted char arrays are alike, the string is anagram
     boolean result = Arrays.equals(arr1, arr2);
     if(result)
    {
       System.out.println(s1 + " and " + s2 + " are anagram of each other.");
     }
     else {
       System.out.println(s1 + " and " + s2 + " are not anagram of each other.");
     }
   }
   else {
     System.out.println(s1 + " and " + s2 + " are not anagram of each other.");
   }
 }
}