1.
Reverse a String Without Using Built-in Reverse
Ques on: Write a method to reverse a given string.
Answer:
java
public class ReverseString {
public sta c String reverse(String str) {
StringBuilder reversed = new StringBuilder();
for (int i = [Link]() - 1; i >= 0; i--) {
[Link]([Link](i));
return [Link]();
public sta c void main(String[] args) {
[Link](reverse("JavaInterview"));
Output:
weivretnIavaJ
Concept tested: string manipula on, control flow.
2. Check if a String is Palindrome
Ques on: How would you check if a string is a palindrome in Java?
Answer:
java
public class PalindromeCheck {
public sta c boolean isPalindrome(String s) {
String rev = new StringBuilder(s).reverse().toString();
return [Link](rev);
public sta c void main(String[] args) {
[Link](isPalindrome("Level")); // true
Concept tested: strings, comparison opera ons.
3. Find Factorial Using Recursion
Answer:
java
public class Factorial {
public sta c int factorial(int n) {
if (n == 0) return 1;
else return n * factorial(n - 1);
public sta c void main(String[] args) {
[Link](factorial(5)); // 120
Concept tested: recursion, base cases, mathema cal logic.
4. Find Fibonacci Series up to N Terms
Answer:
java
public class Fibonacci {
public sta c void printFibonacci(int n) {
int a = 0, b = 1;
for (int i = 0; i < n; i++) {
[Link](a + " ");
int next = a + b;
a = b;
b = next;
public sta c void main(String[] args) {
printFibonacci(7);
Output:
0112358
Concept tested: itera ve loops, numerical sequence logic.
5. Find Duplicate Elements in an Array
Answer:
java
import java.u l.*;
public class FindDuplicates {
public sta c void duplicates(int[] arr) {
Set<Integer> seen = new HashSet<>();
for (int i : arr) {
if ()
[Link]("Duplicate: " + i);
}
public sta c void main(String[] args) {
int[] nums = {1, 3, 5, 3, 7, 1};
duplicates(nums);
Concept tested: collec ons framework, HashSet usage.
6. Sort an Array Without Using Built-in Sort
Answer:
java
public class BubbleSort {
public sta c void sort(int[] arr) {
for (int i = 0; i < [Link] - 1; i++) {
for (int j = 0; j < [Link] - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
public sta c void main(String[] args) {
int[] arr = {5, 3, 8, 1, 2};
sort(arr);
for (int n : arr) [Link](n + " ");
}
Output:
12358
Concept tested: algorithmic logic, sor ng.
7. Find the Second Largest Number in an Array
Answer:
java
public class SecondLargest {
public sta c int findSecond(int[] arr) {
int first = Integer.MIN_VALUE, second = Integer.MIN_VALUE;
for (int n : arr) {
if (n > first) {
second = first;
first = n;
} else if (n > second && n != first) {
second = n;
return second;
public sta c void main(String[] args) {
int[] arr = {10, 4, 7, 9, 12};
[Link](findSecond(arr)); // 10
Concept tested: arrays, comparison operators.
8. Use Streams to Filter and Sort Data
Ques on: How do you filter even numbers and sort them using Java 8 streams?
Answer:
java
import java.u l.*;
import java.u [Link].*;
public class StreamExample {
public sta c void main(String[] args) {
List<Integer> numbers = [Link](5, 1, 8, 2, 4, 9);
[Link]()
.filter(n -> n % 2 == 0)
.sorted()
.forEach([Link]::println);
Output:
248
Concept tested: Java Streams, func onal programming.
9. Find Frequency of Each Character in a String
Answer:
java
import java.u l.*;
public class CharFrequency {
public sta c void main(String[] args) {
String str = "JavaDeveloper";
Map<Character, Integer> map = new HashMap<>();
for (char c : [Link]()) {
[Link](c, [Link](c, 0) + 1);
[Link](map);
Output:
{a=2, v=2, J=1, D=1, e=3, l=1, o=1, p=1, r=1}
Concept tested: map, coun ng algorithms, string itera on.
10. Check if Two Strings Are Anagrams
Answer:
java
import java.u [Link];
public class AnagramCheck {
public sta c boolean isAnagram(String s1, String s2) {
char[] a = [Link]();
char[] b = [Link]();
[Link](a);
[Link](b);
return [Link](a, b);
public sta c void main(String[] args) {
[Link](isAnagram("listen", "silent")); // true
Concept tested: arrays, sor ng logic, equality comparisons.
11. Implement Singleton Design Pa ern
Answer:
java
public class Singleton {
private sta c Singleton instance;
private Singleton() {}
public sta c Singleton getInstance() {
if (instance == null) {
synchronized ([Link]) {
if (instance == null)
instance = new Singleton();
return instance;
Concept tested: design pa erns, thread safety.
12. Mul threading Example — Sum with Runnable
Answer:
java
class SumThread implements Runnable {
private int start, end;
public SumThread(int start, int end) {
[Link] = start;
[Link] = end;
}
public void run() {
int sum = 0;
for (int i = start; i <= end; i++) sum += i;
[Link]([Link]().getName() + ": " + sum);
public sta c void main(String[] args) {
Thread t1 = new Thread(new SumThread(1, 5));
Thread t2 = new Thread(new SumThread(6, 10));
[Link]();
[Link]();
Concept tested: mul threading, concurrency basics.
13. Detect Prime Number
Answer:
java
public class PrimeCheck {
public sta c boolean isPrime(int n) {
if (n <= 1) return false;
for (int i = 2; i <= [Link](n); i++)
if (n % i == 0) return false;
return true;
public sta c void main(String[] args) {
[Link](isPrime(19)); // true
}
}
Concept tested: loops, mathema cal op miza on.
14. Remove Duplicates From List Using Streams
Answer:
java
import java.u l.*;
import java.u [Link];
public class RemoveDuplicates {
public sta c void main(String[] args) {
List<Integer> list = [Link](1, 2, 2, 3, 4, 4, 5);
List<Integer> unique = [Link]().dis nct().collect([Link]());
[Link](unique);
Output:
[10][11][12][13][14]
Concept tested: func onal style filtering, collec on APIs.
15. Find Maximum Repeated Word in a Sentence
Answer:
java
import java.u l.*;
public class WordFrequency {
public sta c void main(String[] args) {
String text = "Java is fun and Java is powerful and robust";
String[] words = [Link](" ");
Map<String, Integer> countMap = new HashMap<>();
for (String w : words)
[Link](w, [Link](w, 0) + 1);
String maxWord = Collec [Link]([Link](),
[Link]()).getKey();
[Link]("Most repeated word: " + maxWord);
