Remove duplicates from string
import [Link].*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
String s = [Link]();
StringBuilder sb = new StringBuilder();
for (char c : [Link]()) {
if ([Link]([Link](c)) == -1)
[Link](c);
}
[Link](sb);
}
}
Reverse each word
import [Link].*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
String s = [Link]();
String words[] = [Link](" ");
StringBuilder result = new StringBuilder();
for (String w : words) {
[Link](new StringBuilder(w).reverse()).append(" ");
}
[Link]([Link]().trim());
}
}
Palindrome
import [Link].*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
String s = [Link]().toLowerCase();
String rev = new StringBuilder(s).reverse().toString();
if ([Link](rev))
[Link]("Yes");
else
[Link]("No");
}
}
Sum of even & odd
import [Link].*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
int n = [Link]();
int even = 0, odd = 0;
for(int i=0; i<n; i++){
int x = [Link]();
if(x % 2 == 0) even += x;
else odd += x;
}
[Link](even);
[Link](odd);
}
}
Second largest
import [Link].*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
int n = [Link]();
int arr[] = new int[n];
for(int i=0; i<n; i++)
arr[i] = [Link]();
int largest = Integer.MIN_VALUE;
int second = Integer.MIN_VALUE;
for(int x : arr) {
if(x > largest) {
second = largest;
largest = x;
} else if(x > second && x != largest) {
second = x;
}
}
[Link](second);
}
}
Reverse a String (without using library functions)
import [Link];
public class ReverseString {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter a string: ");
String str = [Link]();
char[] chars = [Link]();
int left = 0, right = [Link] - 1;
while (left < right) {
char temp = chars[left];
chars[left] = chars[right];
chars[right] = temp;
left++;
right--;
}
[Link]("Reversed string: " + new String(chars));
[Link]();
}
}
Check Whether a Number is Prime
import [Link];
public class PrimeCheck {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter a number: ");
int n = [Link]();
boolean isPrime = true;
if (n <= 1) isPrime = false;
else {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
isPrime = false;
break;
}
}
}
[Link](n + (isPrime ? " is a prime number" : " is not a prime number"));
[Link]();
}
}
Find Largest and Smallest Elements in an Array
import [Link];
public class LargestSmallestArray {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter array size: ");
int n = [Link]();
int[] arr = new int[n];
[Link]("Enter array elements: ");
for (int i = 0; i < n; i++) arr[i] = [Link]();
int max = arr[0], min = arr[0];
for (int num : arr) {
if (num > max)
max = num;
if (num < min)
min = num;
}
[Link]("Largest element: " + max);
[Link]("Smallest element: " + min);
[Link]();
}
}
Sum of All Even Numbers in an Array
import [Link];
public class SumEvenNumbers {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter array size: ");
int n = [Link]();
int[] arr = new int[n];
[Link]("Enter array elements: ");
for (int i = 0; i < n; i++) arr[i] = [Link]();
int sum = 0;
for (int num : arr) {
if (num % 2 == 0) sum += num;
}
[Link]("Sum of even numbers: " + sum);
[Link]();
}
}
Check if a String is a Palindrome
import [Link];
public class PalindromeCheck {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter a string: ");
String str = [Link]();
int left = 0, right = [Link]() - 1;
boolean isPalindrome = true;
while (left < right) {
if ([Link](left) != [Link](right)) {
isPalindrome = false;
break;
}
left++;
right--;
}
[Link](str + (isPalindrome ? " is a palindrome" : " is not a palindrome"));
[Link]();
}
}