Scribd
Upload
7 views4 pages

Master Java Logic Building With This Ultimate Cheat Sheet!

Uploaded by

manickvel60
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views4 pages

Master Java Logic Building With This Ultimate Cheat Sheet!

Uploaded by

manickvel60
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Java Logic Building Cheat Sheet

1. Input/Output in Java

import java.util.Scanner;
Scanner sc = new Scanner(System.in);
int num = sc.nextInt();
String name = sc.nextLine();

2. Loops & Conditionals

For Loop:
for (int i = 0; i < 5; i++) {
System.out.println(i);
}

While Loop:
int i = 0;
while (i < 5) {
System.out.println(i);
i++;
}

If-Else:
if (num % 2 == 0) {
System.out.println("Even");
} else {
System.out.println("Odd");
}

3. Common Logic Building Examples

Reverse a Number:
int rev = 0;
while (num > 0) {
int digit = num % 10;
rev = rev * 10 + digit;
num /= 10;
}

Check Prime Number:


boolean isPrime = true;
for (int i = 2; i <= Math.sqrt(num); i++) {
if (num % i == 0) {
isPrime = false;
break;
}
}

Find Factorial:
int fact = 1;
for (int i = 1; i <= num; i++) {
fact *= i;
}

Palindrome Check (Number):


int temp = num, rev = 0;
while (num > 0) {
rev = rev * 10 + num % 10;
num /= 10;
}
if (temp == rev) System.out.println("Palindrome");

Sum of Digits:
int sum = 0;
while (num > 0) {
sum += num % 10;
num /= 10;
}

4. Java Patterns

Star Pyramid:
for (int i = 1; i <= 5; i++) {
for (int j = 1; j <= i; j++) {
System.out.print("* ");
}
System.out.println();
}

5. Useful Java Functions

Math.abs(x), Math.max(a, b), Math.min(a, b)


Math.pow(a, b), Math.sqrt(x)
Arrays.sort(arr)
Integer.parseInt("123"), String.valueOf(123)

6. Arrays

Traverse Array:
for (int i = 0; i < arr.length; i++) {
System.out.println(arr[i]);
}

Find Maximum:
int max = arr[0];
for (int i = 1; i < arr.length; i++) {
if (arr[i] > max) max = arr[i];
}

Reverse Array:
int start = 0, end = arr.length - 1;
while (start < end) {
int temp = arr[start];
arr[start] = arr[end];
arr[end] = temp;
start++;
end--;
}

7. Strings

Reverse String:
String rev = "";
for (int i = str.length() - 1; i >= 0; i--) {
rev += str.charAt(i);
}

Count Vowels:
int count = 0;
for (char c : str.toCharArray()) {
if ("aeiouAEIOU".indexOf(c) != -1) count++;
}

Palindrome Check:
String rev = new StringBuilder(str).reverse().toString();
if (str.equals(rev)) System.out.println("Palindrome");

8. Recursion

Factorial:
int factorial(int n) {
if (n == 0) return 1;
return n * factorial(n - 1);
}

Fibonacci:
int fibonacci(int n) {
if (n <= 1) return n;
return fibonacci(n - 1) + fibonacci(n - 2);
}

9. Searching
Linear Search:
for (int i = 0; i < arr.length; i++) {
if (arr[i] == target) return i;
}

Binary Search:
int left = 0, right = arr.length - 1;
while (left <= right) {
int mid = (left + right) / 2;
if (arr[mid] == target) return mid;
else if (arr[mid] < target) left = mid + 1;
else right = mid - 1;
}

10. Sorting

Bubble Sort:
for (int i = 0; i < arr.length - 1; i++) {
for (int j = 0; j < arr.length - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}

11. Hashing

Frequency Count using HashMap:


HashMap<Integer, Integer> freq = new HashMap<>();
for (int num : arr) {
freq.put(num, freq.getOrDefault(num, 0) + 1);
}

Check for Duplicates using HashSet:


HashSet<Integer> set = new HashSet<>();
for (int num : arr) {
if (set.contains(num)) {
System.out.println("Duplicate found");
break;
}
set.add(num);
}

You might also like