0% found this document useful (0 votes)
25 views2 pages

Java Coding Questions With Answers-1

Uploaded by

ragavimars48
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
0% found this document useful (0 votes)
25 views2 pages

Java Coding Questions With Answers-1

Uploaded by

ragavimars48
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/ 2

Java Coding Questions with Answers

1. Reverse a String
String str = "SecPod";
String reversed = new StringBuilder(str).reverse().toString();
System.out.println(reversed); // Output: doPceS

2. Merge Two Sorted Arrays


int[] a = {1, 3, 5};
int[] b = {2, 4, 6};
int[] result = new int[a.length + b.length];
int i = 0, j = 0, k = 0;

while (i < a.length && j < b.length) {


if (a[i] < b[j]) result[k++] = a[i++];
else result[k++] = b[j++];
}
while (i < a.length) result[k++] = a[i++];
while (j < b.length) result[k++] = b[j++];
System.out.println(Arrays.toString(result)); // Output: [1, 2, 3, 4, 5, 6]

3. Check Palindrome
String s = "level";
boolean isPalindrome = true;
int i = 0, j = s.length() - 1;
while (i < j) {
if (s.charAt(i) != s.charAt(j)) {
isPalindrome = false;
break;
}
i++; j--;
}
System.out.println(isPalindrome); // Output: true

4. Remove Duplicate Characters


String str = "aabbcc";
StringBuilder result = new StringBuilder();
boolean[] seen = new boolean[26];

for (int i = 0; i < str.length(); i++) {


char ch = str.charAt(i);
if (!seen[ch - 'a']) {
seen[ch - 'a'] = true;
result.append(ch);
}
}
System.out.println(result); // Output: abc

5. Character Frequency Count


String s = "hello";
int[] freq = new int[26];
for (int i = 0; i < s.length(); i++) {
freq[s.charAt(i) - 'a']++;
}
for (int i = 0; i < 26; i++) {
if (freq[i] > 0) {
char ch = (char) (i + 'a');
System.out.println(ch + ": " + freq[i]);
}
}

6. Find Missing Number in Array


int[] arr = {1, 2, 4, 5};
int n = 5; // Since 1 to 5, length should be 5
int total = n * (n + 1) / 2;
int sum = 0;
for (int num : arr) {
sum += num;
}
System.out.println("Missing number: " + (total - sum)); // Output: 3

You might also like