Reverse a Number
imort [Link];
public class ReverseNumber
{
static int reverse(int num)
{
int rev = 0;
while (num != 0)
{
rev = rev * 10 + num % 10;
num /= 10;
}
return rev;
}
public static void main(String[] args)
{
Scanner sc = new Scanner([Link]);
[Link]("Enter a number: ");
int num = [Link]();
[Link]("Reversed number: " + reverse(num));
[Link]();
}
}
2. Sum of Digits
import [Link];
public class SumOfDigits
{
static int sumDigits(int num)
{
int sum = 0;
while (num != 0)
{
sum += num % 10;
num /= 10;
}
return sum;
}
public static void main(String[] args)
{
Scanner sc = new Scanner([Link]);
[Link]("Enter a number: ");
int num = [Link]();
[Link]("Sum of digits: " + sumDigits(num));
[Link]();
}
}
3. Palindrome Number
import [Link];
public class PalindromeNumber
{
static boolean isPalindrome(int num)
{
int temp = num, rev = 0;
while (temp != 0)
{
rev = rev * 10 + temp % 10;
temp /= 10;
}
return num == rev;
}
public static void main(String[] args)
{
Scanner sc = new Scanner([Link]);
[Link]("Enter a number: ");
int num = [Link]();
[Link](num + (isPalindrome(num) ? " is Palindrome" : " is Not Palindrome"));
[Link]();
}
}
4. Armstrong Number
import [Link];
public class ArmstrongNumber
{
static boolean isArmstrong(int num)
{
int temp = num, sum = 0;
int digits = [Link](num).length();
while (temp != 0) {
int digit = temp % 10;
sum += [Link](digit, digits);
temp /= 10;
}
return sum == num;
}
public static void main(String[] args)
{
Scanner sc = new Scanner([Link]);
[Link]("Enter a number: ");
int num = [Link]();
[Link](num + (isArmstrong(num) ? " is Armstrong" : " is Not Armstrong"));
[Link]();
}
}
5. Prime Number
import [Link];
public class PrimeCheck
{
static boolean isPrime(int num)
{
if (num <= 1) return false;
for (int i = 2; i <= [Link](num); i++)
{
if (num % i == 0) return false;
}
return true;
}
public static void main(String[] args)
{
Scanner sc = new Scanner([Link]);
[Link]("Enter a number: ");
int num = [Link]();
[Link](num + (isPrime(num) ? " is Prime" : " is Not Prime"));
[Link]();
}
}
6. Prime Numbers in Range
import [Link];
public class PrimeRange
{
static boolean isPrime(int num)
{
if (num <= 1) return false;
for (int i = 2; i <= [Link](num); i++)
{
if (num % i == 0) return false;
}
return true;
}
static void printPrimes(int start, int end)
{
for (int i = start; i <= end; i++)
{
if (isPrime(i)) [Link](i + " ");
}
}
public static void main(String[] args)
{
Scanner sc = new Scanner([Link]);
[Link]("Enter start: ");
int start = [Link]();
[Link]("Enter end: ");
int end = [Link]();
[Link]("Prime numbers: ");
printPrimes(start, end);
[Link]();
}
}
7. Factorial (Iterative & Recursive)
import [Link];
public class Factorial
{
static int factorialIterative(int n)
{
int fact = 1;
for (int i = 1; i <= n; i++) fact *= i;
return fact;
}
static int factorialRecursive(int n)
{
if (n == 0) return 1;
return n * factorialRecursive(n - 1);
}
public static void main(String[] args)
{
Scanner sc = new Scanner([Link]);
[Link]("Enter a number: ");
int num = [Link]();
[Link]("Iterative: " + factorialIterative(num));
[Link]("Recursive: " + factorialRecursive(num));
[Link]();
}
}
8. Fibonacci Series (Iterative & Recursive)
import [Link];
public class Fibonacci
{
static void fibonacciIterative(int count)
{
int a = 0, b = 1;
for (int i = 1; i <= count; i++)
{
[Link](a + " ");
int sum = a + b;
a = b;
b = sum;
}
}
static int fibonacciRecursive(int n)
{
if (n <= 1) return n;
return fibonacciRecursive(n - 1) + fibonacciRecursive(n - 2);
}
public static void main(String[] args)
{
Scanner sc = new Scanner([Link]);
[Link]("Enter number of terms: ");
int terms = [Link]();
[Link]("Iterative: ");
fibonacciIterative(terms);
[Link]("\nRecursive: ");
for (int i = 0; i < terms; i++) {
[Link](fibonacciRecursive(i) + " ");
}
[Link]();
}
}
9. GCD
import [Link];
public class GCD
{
static int findGCD(int a, int b)
{
while (b != 0)
{
int temp = b;
b = a % b;
a = temp;
}
return a;
}
public static void main(String[] args)
{
Scanner sc = new Scanner([Link]);
[Link]("Enter first number: ");
int a = [Link]();
[Link]("Enter second number: ");
int b = [Link]();
[Link]("GCD: " + findGCD(a, b));
[Link]();
}
}
10. LCM
import [Link];
public class LCM
{
static int findGCD(int a, int b)
{
return b == 0 ? a : findGCD(b, a % b);
}
static int findLCM(int a, int b)
{
return (a * b) / findGCD(a, b);
}
public static void main(String[] args)
{
Scanner sc = new Scanner([Link]);
[Link]("Enter first number: ");
int a = [Link]();
[Link]("Enter second number: ");
int b = [Link]();
[Link]("LCM: " + findLCM(a, b));
[Link]();
}
}
11. Swap Without Temp
import [Link];
public class SwapNumbers
{
static void swap(int a, int b)
{
a = a + b;
b = a - b;
a = a - b;
[Link]("After swap: a = " + a + ", b = " + b);
}
public static void main(String[] args)
{
Scanner sc = new Scanner([Link]);
[Link]("Enter a: ");
int a = [Link]();
[Link]("Enter b: ");
int b = [Link]();
swap(a, b);
[Link]();
}
}
12. Count Digits
import [Link];
public class CountDigits
{
static int countDigits(int num)
{
int count = 0;
while (num != 0)
{
num /= 10;
count++;
}
return count;
}
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter a number: ");
int num = [Link]();
[Link]("Number of digits: " + countDigits(num));
[Link]();
}
}
Find Largest & Smallest Element in an Array
import [Link].*;
public class LargestSmallest {
public static void findLargestSmallest(int[] arr) {
int largest = arr[0], smallest = arr[0];
for (int num : arr) {
if (num > largest) largest = num;
if (num < smallest) smallest = num;
}
[Link]("Largest: " + largest);
[Link]("Smallest: " + smallest);
}
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter size of array: ");
int n = [Link]();
int[] arr = new int[n];
[Link]("Enter elements:");
for (int i = 0; i < n; i++) arr[i] = [Link]();
findLargestSmallest(arr);
}
}
2. Find Second Largest & Second Smallest Element
import [Link].*;
public class SecondLargestSmallest {
public static void findSecond(int[] arr) {
[Link](arr);
[Link]("Second Smallest: " + arr[1]);
[Link]("Second Largest: " + arr[[Link] - 2]);
}
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter size: ");
int n = [Link]();
int[] arr = new int[n];
[Link]("Enter elements:");
for (int i = 0; i < n; i++) arr[i] = [Link]();
findSecond(arr);
}
}
3. Reverse an Array
import [Link].*;
public class ReverseArray {
public static void reverse(int[] arr) {
int start = 0, end = [Link] - 1;
while (start < end) {
int temp = arr[start];
arr[start] = arr[end];
arr[end] = temp;
start++; end--;
}
[Link]("Reversed Array: " + [Link](arr));
}
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter size: ");
int n = [Link]();
int[] arr = new int[n];
[Link]("Enter elements:");
for (int i = 0; i < n; i++) arr[i] = [Link]();
reverse(arr);
}
}
4. Check if Array is Sorted
java
CopyEdit
import [Link].*;
public class CheckSorted {
public static boolean isSorted(int[] arr) {
for (int i = 1; i < [Link]; i++) {
if (arr[i] < arr[i - 1]) return false;
}
return true;
}
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter size: ");
int n = [Link]();
int[] arr = new int[n];
[Link]("Enter elements:");
for (int i = 0; i < n; i++) arr[i] = [Link]();
[Link](isSorted(arr) ? "Sorted" : "Not Sorted");
}
}
5. Sort Array ([Link]() & Manual Sorting)
import [Link].*;
public class SortArray {
public static void manualSort(int[] arr) {
for (int i = 0; i < [Link] - 1; i++) {
for (int j = i + 1; j < [Link]; j++) {
if (arr[i] > arr[j]) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
}
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter size: ");
int n = [Link]();
int[] arr = new int[n];
[Link]("Enter elements:");
for (int i = 0; i < n; i++) arr[i] = [Link]();
int[] arrCopy = [Link]();
[Link](arr);
[Link]("Sorted ([Link]): " + [Link](arr));
manualSort(arrCopy);
[Link]("Sorted (Manual): " + [Link](arrCopy));
}
}
6. Remove Duplicates from Array
import [Link].*;
public class RemoveDuplicates {
public static void removeDuplicates(int[] arr) {
Set<Integer> set = new LinkedHashSet<>();
for (int num : arr) [Link](num);
[Link]("Array without duplicates: " + set);
}
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter size: ");
int n = [Link]();
int[] arr = new int[n];
[Link]("Enter elements:");
for (int i = 0; i < n; i++) arr[i] = [Link]();
removeDuplicates(arr);
}
}
7. Merge Two Arrays
import [Link].*;
public class MergeArrays {
public static void merge(int[] arr1, int[] arr2) {
int[] merged = new int[[Link] + [Link]];
int k = 0;
for (int num : arr1) merged[k++] = num;
for (int num : arr2) merged[k++] = num;
[Link]("Merged Array: " + [Link](merged));
}
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter size of first array: ");
int n1 = [Link]();
int[] arr1 = new int[n1];
[Link]("Enter elements of first array:");
for (int i = 0; i < n1; i++) arr1[i] = [Link]();
[Link]("Enter size of second array: ");
int n2 = [Link]();
int[] arr2 = new int[n2];
[Link]("Enter elements of second array:");
for (int i = 0; i < n2; i++) arr2[i] = [Link]();
merge(arr1, arr2);
}
}
8. Find Missing Number in Sequence
import [Link].*;
public class MissingNumber {
public static void findMissing(int[] arr, int n) {
int totalSum = n * (n + 1) / 2;
int sum = 0;
for (int num : arr) sum += num;
[Link]("Missing Number: " + (totalSum - sum));
}
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter n (last number in sequence): ");
int n = [Link]();
int[] arr = new int[n - 1];
[Link]("Enter " + (n - 1) + " numbers:");
for (int i = 0; i < n - 1; i++) arr[i] = [Link]();
findMissing(arr, n);
}
}
9. Find Frequency of Each Element
import [Link].*;
public class Frequency {
public static void findFrequency(int[] arr) {
Map<Integer, Integer> map = new LinkedHashMap<>();
for (int num : arr) [Link](num, [Link](num, 0) + 1);
[Link]("Frequency: " + map);
}
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter size: ");
int n = [Link]();
int[] arr = new int[n];
[Link]("Enter elements:");
for (int i = 0; i < n; i++) arr[i] = [Link]();
findFrequency(arr);
}
}
10. Rotate Array Left/Right by n Positions
import [Link].*;
public class RotateArray {
public static void rotateLeft(int[] arr, int d) {
int n = [Link];
d %= n;
int[] rotated = new int[n];
for (int i = 0; i < n; i++) {
rotated[i] = arr[(i + d) % n];
}
[Link]("Left Rotated: " + [Link](rotated));
}
public static void rotateRight(int[] arr, int d) {
int n = [Link];
d %= n;
int[] rotated = new int[n];
for (int i = 0; i < n; i++) {
rotated[(i + d) % n] = arr[i];
}
[Link]("Right Rotated: " + [Link](rotated));
}
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter size: ");
int n = [Link]();
int[] arr = new int[n];
[Link]("Enter elements:");
for (int i = 0; i < n; i++) arr[i] = [Link]();
[Link]("Enter positions to rotate: ");
int d = [Link]();
rotateLeft(arr, d);
rotateRight(arr, d);
}
}
Reverse a String
Using Loop
public class ReverseStringLoop {
public static void main(String[] args) {
String str = "Hello";
String reversed = "";
for (int i = [Link]() - 1; i >= 0; i--) {
reversed += [Link](i);
}
[Link]("Reversed: " + reversed);
}
}
Using StringBuilder
public class ReverseStringBuilder {
public static void main(String[] args) {
String str = "Hello";
String reversed = new StringBuilder(str).reverse().toString();
[Link]("Reversed: " + reversed);
}
}
2. Check Palindrome String
public class PalindromeCheck {
public static void main(String[] args) {
String str = "madam";
String reversed = new StringBuilder(str).reverse().toString();
if ([Link](reversed)) {
[Link]("Palindrome");
} else {
[Link]("Not Palindrome");
}
}
}
3. Count Vowels & Consonants
public class VowelConsonantCount {
public static void main(String[] args) {
String str = "Hello World";
str = [Link]();
int vowels = 0, consonants = 0;
for (char ch : [Link]()) {
if (ch >= 'a' && ch <= 'z') {
if ("aeiou".indexOf(ch) != -1) vowels++;
else consonants++;
}
}
[Link]("Vowels: " + vowels);
[Link]("Consonants: " + consonants);
}
}
4. Count Words in a String
public class WordCount {
public static void main(String[] args) {
String str = "Java is fun";
String[] words = [Link]().split("\\s+");
[Link]("Word count: " + [Link]);
}
}
5. Remove All Whitespace
public class RemoveWhitespace {
public static void main(String[] args) {
String str = " Java Programming ";
String result = [Link]("\\s+", "");
[Link]("Without spaces: " + result);
}
}
6. Remove Duplicates from String
public class RemoveDuplicates {
public static void main(String[] args) {
String str = "programming";
StringBuilder result = new StringBuilder();
for (int i = 0; i < [Link](); i++) {
char ch = [Link](i);
if ([Link]([Link](ch)) == -1) {
[Link](ch);
}
}
[Link]("Without duplicates: " + result);
}
}
7. Anagram Check
import [Link];
public class AnagramCheck {
public static void main(String[] args) {
String str1 = "listen";
String str2 = "silent";
char[] arr1 = [Link]();
char[] arr2 = [Link]();
[Link](arr1);
[Link](arr2);
if ([Link](arr1, arr2)) {
[Link]("Anagram");
} else {
[Link]("Not Anagram");
}
}
}
8. First Non-Repeating Character
public class FirstNonRepeating {
public static void main(String[] args) {
String str = "swiss";
for (char ch : [Link]()) {
if ([Link](ch) == [Link](ch)) {
[Link]("First non-repeating: " + ch);
break;
}
}
}
}
9. Character Frequency Count (HashMap)
import [Link];
public class CharFrequency {
public static void main(String[] args) {
String str = "hello";
HashMap<Character, Integer> map = new HashMap<>();
for (char ch : [Link]()) {
[Link](ch, [Link](ch, 0) + 1);
}
[Link]("Character Frequencies: " + map);
}
}
10. Check if String Contains Only Digits
public class OnlyDigits {
public static void main(String[] args) {
String str = "12345";
if ([Link]("\\d+")) {
[Link]("Contains only digits");
} else {
[Link]("Contains non-digit characters");
}
}
}
