Scribd
Upload
20 views2 pages

Java Logic Coding Questions & Solutions

The document contains over 100 logic-building coding questions with Java solutions, focusing on number and string logic. It includes examples such as checking for prime numbers, generating Fibonacci series, verifying Armstrong numbers, and string manipulations like palindrome checks and anagram comparisons. Each question is accompanied by a code snippet demonstrating the solution in Java.

Uploaded by

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

Java Logic Coding Questions & Solutions

The document contains over 100 logic-building coding questions with Java solutions, focusing on number and string logic. It includes examples such as checking for prime numbers, generating Fibonacci series, verifying Armstrong numbers, and string manipulations like palindrome checks and anagram comparisons. Each question is accompanied by a code snippet demonstrating the solution in Java.

Uploaded by

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

100+ Logic Building Coding Questions

with Java Solutions


Number Logic Questions
 Q: Check if a number is prime

public static 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;
}

 Q: Generate Fibonacci series up to N terms

public static void printFibonacci(int n) {


int a = 0, b = 1;
for (int i = 0; i < n; i++) {
[Link](a + " ");
int temp = a + b;
a = b;
b = temp;
}
}

 Q: Check if a number is Armstrong

public static boolean isArmstrong(int n) {


int temp = n, sum = 0, digits = [Link](n).length();
while (temp > 0) {
int digit = temp % 10;
sum += [Link](digit, digits);
temp /= 10;
}
return sum == n;
}
String Logic Questions
 Q: Check if a string is palindrome

public static boolean isPalindrome(String s) {


return [Link](new StringBuilder(s).reverse().toString());
}

 Q: Reverse a string

public static String reverseString(String s) {


return new StringBuilder(s).reverse().toString();
}

 Q: Check if two strings are anagrams

public static boolean areAnagrams(String str1, String str2) {


char[] a = [Link]();
char[] b = [Link]();
[Link](a);
[Link](b);
return [Link](a, b);
}

You might also like