Java Practice Questions - Recursion, Strings &

Arrays

Recursion

Q1 [Easy] Print numbers from 1 to N using recursion

Explanation: Each recursive call prints the next number until n==0.
class RecQ1 {
static void printNumbers(int n) {
if(n == 0) return;
printNumbers(n-1);
[Link](n + " ");
}
public static void main(String[] args) {
printNumbers(5); // Output: 1 2 3 4 5
}
}

Q2 [Easy-Medium] Sum of digits of a number using recursion

Explanation: Split number into last digit + sum of remaining.
class RecQ2 {
static int sumDigits(int n) {
if(n == 0) return 0;
return (n % 10) + sumDigits(n/10);
}
public static void main(String[] args) {
[Link](sumDigits(1234)); // 10
}
}

Q3 [Medium] Reverse a string using recursion

Explanation: Take first char, call function for rest, append char at last.
class RecQ3 {
static String reverse(String s) {
if([Link]()) return s;
return reverse([Link](1)) + [Link](0);
}
public static void main(String[] args) {
[Link](reverse("java")); // avaj
}
}

Q4 [Medium-Hard] Check if a string is palindrome using recursion

Explanation: Compare first & last char, then check middle substring.
class RecQ4 {
static boolean isPalindrome(String s, int start, int end) {
if(start >= end) return true;
if([Link](start) != [Link](end)) return false;
return isPalindrome(s, start+1, end-1);
}
public static void main(String[] args) {
String s = "madam";
[Link](isPalindrome(s, 0, [Link]()-1)); // true
 }
}

Q5 [Hard] Tower of Hanoi

Explanation: Move n-1 disks → move largest → move n-1 again.
class RecQ5 {
static void hanoi(int n, char from, char to, char aux) {
if(n == 1) {
[Link]("Move disk 1 from " + from + " to " + to);
return;
}
hanoi(n-1, from, aux, to);
[Link]("Move disk " + n + " from " + from + " to " + to);
hanoi(n-1, aux, to, from);
}
public static void main(String[] args) {
hanoi(3, 'A', 'C', 'B');
}
}

Strings

Q1 [Easy] Count vowels in a string

class StrQ1 {
static int countVowels(String s) {
int count=0;
s = [Link]();
for(char c : [Link]()) {
if("aeiou".indexOf(c) != -1) count++;
}
return count;
}
public static void main(String[] args) {
[Link](countVowels("Hello Java")); // 4
}
}

Q2 [Easy-Medium] Check if two strings are anagrams

import [Link];
class StrQ2 {
static boolean isAnagram(String s1, String s2) {
char[] a = [Link](" ", "").toLowerCase().toCharArray();
char[] b = [Link](" ", "").toLowerCase().toCharArray();
[Link](a); [Link](b);
return [Link](a, b);
}
public static void main(String[] args) {
[Link](isAnagram("listen", "silent")); // true
}
}

Q3 [Medium] First non-repeated character in a string

import [Link];
class StrQ3 {
static char firstUnique(String s) {
LinkedHashMap<Character,Integer> map = new LinkedHashMap<>();
 for(char c : [Link]()) [Link](c, [Link](c,0)+1);
for(char c : [Link]()) if([Link](c)==1) return c;
return '_';
}
public static void main(String[] args) {
[Link](firstUnique("swiss")); // w
}
}

Q4 [Medium-Hard] Longest substring without repeating characters

import [Link].*;
class StrQ4 {
static int longestUnique(String s) {
HashSet<Character> set = new HashSet<>();
int left=0, max=0;
for(int right=0; right<[Link](); right++) {
while([Link]([Link](right)))
[Link]([Link](left++));
[Link]([Link](right));
max = [Link](max, right-left+1);
}
return max;
}
public static void main(String[] args) {
[Link](longestUnique("abcabcbb")); // 3
}
}

Q5 [Hard] Check if a string is rotation of another

class StrQ5 {
static boolean isRotation(String s1, String s2) {
if([Link]()!=[Link]()) return false;
return (s1+s1).contains(s2);
}
public static void main(String[] args) {
[Link](isRotation("waterbottle", "erbottlewat")); // true
}
}

Arrays

Q1 [Easy] Find largest element in array

class ArrQ1 {
static int largest(int[] arr) {
int max = arr[0];
for(int n : arr) if(n > max) max = n;
return max;
}
public static void main(String[] args) {
int[] arr = {2,8,5,1,10};
[Link](largest(arr)); // 10
}
}

Q2 [Easy-Medium] Reverse an array

class ArrQ2 {
 static void reverse(int[] arr) {
int i=0, j=[Link]-1;
while(i<j) {
int temp = arr[i]; arr[i]=arr[j]; arr[j]=temp;
i++; j--;
}
}
public static void main(String[] args) {
int[] arr = {1,2,3,4,5};
reverse(arr);
for(int n : arr) [Link](n+" ");
}
}

Q3 [Medium] Second largest element in array

class ArrQ3 {
static int secondLargest(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 static void main(String[] args) {
int[] arr = {10,20,4,45,99};
[Link](secondLargest(arr)); // 45
}
}

Q4 [Medium-Hard] Move all zeros to end of array

class ArrQ4 {
static void moveZeros(int[] arr) {
int index=0;
for(int n : arr) if(n!=0) arr[index++] = n;
while(index < [Link]) arr[index++] = 0;
}
public static void main(String[] args) {
int[] arr = {0,1,0,3,12};
moveZeros(arr);
for(int n : arr) [Link](n+" ");
}
}

Q5 [Hard] Find missing number in an array (1 to n)

class ArrQ5 {
static int missingNumber(int[] arr, int n) {
int total = n*(n+1)/2;
int sum=0;
for(int num : arr) sum += num;
return total - sum;
}
public static void main(String[] args) {
int[] arr = {1,2,4,5,6};
 [Link](missingNumber(arr,6)); // 3
}
}