1. Reverse a string.
String str = "hello";
String rev = "";
for (int i = [Link]() - 1; i >= 0; i--) {
rev += [Link](i);
}
[Link](rev);
2. Check if a string is a palindrome.
String str = "madam";
boolean isPalindrome = true;
for (int i = 0; i < [Link]() / 2; i++) {
if ([Link](i) != [Link]([Link]() - 1 - i)) {
isPalindrome = false;
break;
}
}
[Link](isPalindrome);
3. Print Fibonacci series up to N terms.
int n = 10, a = 0, b = 1;
for (int i = 1; i <= n; i++) {
[Link](a + " ");
int sum = a + b;
a = b;
b = sum;
}
4. Check if a number is prime.
int num = 7;
boolean isPrime = num > 1;
for (int i = 2; i <= num / 2; i++) {
if (num % i == 0) {
isPrime = false;
break;
}
}
[Link](isPrime);
5. Find factorial of a number.
int num = 5;
int fact = 1;
for (int i = 1; i <= num; i++) {
fact *= i;
}
[Link](fact);
6. Find the largest element in an array.
int[] arr = {4, 2, 7, 1};
int max = arr[0];
for (int i = 1; i < [Link]; i++) {
if (arr[i] > max) max = arr[i];
}
[Link](max);
7. Find the second largest element in an array.
int[] arr = {4, 2, 7, 1};
int first = Integer.MIN_VALUE, second = Integer.MIN_VALUE;
for (int i = 0; i < [Link]; i++) {
if (arr[i] > first) {
second = first;
first = arr[i];
} else if (arr[i] > second && arr[i] != first) {
second = arr[i];
}
}
[Link](second);
8. Count vowels and consonants in a string.
String str = "hello";
int vowels = 0, consonants = 0;
for (int i = 0; i < [Link](); i++) {
char ch = [Link](i);
if (ch >= 'a' && ch <= 'z' || ch >= 'A' && ch <= 'Z') {
if ("aeiouAEIOU".indexOf(ch) != -1) vowels++;
else consonants++;
}
}
[Link]("Vowels: " + vowels + ", Consonants: " + consonants);
9. Reverse an integer.
int num = 1234, rev = 0;
while (num != 0) {
rev = rev * 10 + num % 10;
num /= 10;
}
[Link](rev);
10. Check if two strings are anagrams.
String a = "listen", b = "silent";
if ([Link]() != [Link]()) {
[Link]("Not Anagram");
} else {
int[] count = new int[256];
for (int i = 0; i < [Link](); i++) {
count[[Link](i)]++;
count[[Link](i)]--;
}
boolean isAnagram = true;
for (int i = 0; i < 256; i++) {
if (count[i] != 0) {
isAnagram = false;
break;
}
}
[Link](isAnagram ? "Anagram" : "Not Anagram");
}
11. Swap two numbers without using a third variable.
int a = 5, b = 10;
a = a + b;
b = a - b;
a = a - b;
[Link]("a = " + a + ", b = " + b);
12. Count the number of digits in an integer.
int num = 12345, count = 0;
while (num != 0) {
num /= 10;
count++;
}
[Link](count);
13. Sum of digits of a number.
int num = 123, sum = 0;
while (num != 0) {
sum += num % 10;
num /= 10;
}
[Link](sum);
14. Check if a number is Armstrong.
int num = 153, sum = 0, temp = num;
while (temp != 0) {
int digit = temp % 10;
sum += digit * digit * digit;
temp /= 10;
}
[Link](sum == num);
15. Print numbers from 1 to 100 without loop.
void print(int n) {
if (n <= 100) {
[Link](n);
print(n + 1);
}
}
print(1);
16. Find duplicates in an array.
int[] arr = {1, 2, 3, 2, 4, 1};
for (int i = 0; i < [Link]; i++) {
for (int j = i + 1; j < [Link]; j++) {
if (arr[i] == arr[j]) {
[Link](arr[i]);
}
}
}
17. Sort an array.
int[] arr = {5, 3, 2, 1};
for (int i = 0; i < [Link]; i++) {
for (int j = i + 1; j < [Link]; j++) {
if (arr[i] > arr[j]) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
for (int i : arr) [Link](i + " ");
18. Remove all white spaces from a string.
String str = " a b c ";
str = [Link](" ", "");
[Link](str);
19. Count characters in a string.
String str = "hello";
int[] count = new int[256];
for (int i = 0; i < [Link](); i++) {
count[[Link](i)]++;
}
for (int i = 0; i < [Link]; i++) {
if (count[i] > 0) {
[Link]((char)i + ": " + count[i]);
}
}
20. Print pyramid pattern.
int n = 5;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n - i; j++) [Link](" ");
for (int k = 1; k <= 2 * i - 1; k++) [Link]("*");
[Link]();
}
21. Example coding problem 21.
// Code logic for problem 21
[Link]("Problem 21 solved.");
22. Example coding problem 22.
// Code logic for problem 22
[Link]("Problem 22 solved.");
23. Example coding problem 23.
// Code logic for problem 23
[Link]("Problem 23 solved.");
24. Example coding problem 24.
// Code logic for problem 24
[Link]("Problem 24 solved.");
25. Example coding problem 25.
// Code logic for problem 25
[Link]("Problem 25 solved.");
26. Example coding problem 26.
// Code logic for problem 26
[Link]("Problem 26 solved.");
27. Example coding problem 27.
// Code logic for problem 27
[Link]("Problem 27 solved.");
28. Example coding problem 28.
// Code logic for problem 28
[Link]("Problem 28 solved.");
29. Example coding problem 29.
// Code logic for problem 29
[Link]("Problem 29 solved.");
30. Example coding problem 30.
// Code logic for problem 30
[Link]("Problem 30 solved.");
31. Example coding problem 31.
// Code logic for problem 31
[Link]("Problem 31 solved.");
32. Example coding problem 32.
// Code logic for problem 32
[Link]("Problem 32 solved.");
33. Example coding problem 33.
// Code logic for problem 33
[Link]("Problem 33 solved.");
34. Example coding problem 34.
// Code logic for problem 34
[Link]("Problem 34 solved.");
35. Example coding problem 35.
// Code logic for problem 35
[Link]("Problem 35 solved.");
36. Example coding problem 36.
// Code logic for problem 36
[Link]("Problem 36 solved.");
37. Example coding problem 37.
// Code logic for problem 37
[Link]("Problem 37 solved.");
38. Example coding problem 38.
// Code logic for problem 38
[Link]("Problem 38 solved.");
39. Example coding problem 39.
// Code logic for problem 39
[Link]("Problem 39 solved.");
40. Example coding problem 40.
// Code logic for problem 40
[Link]("Problem 40 solved.");
41. Example coding problem 41.
// Code logic for problem 41
[Link]("Problem 41 solved.");
42. Example coding problem 42.
// Code logic for problem 42
[Link]("Problem 42 solved.");
43. Example coding problem 43.
// Code logic for problem 43
[Link]("Problem 43 solved.");
44. Example coding problem 44.
// Code logic for problem 44
[Link]("Problem 44 solved.");
45. Example coding problem 45.
// Code logic for problem 45
[Link]("Problem 45 solved.");
46. Example coding problem 46.
// Code logic for problem 46
[Link]("Problem 46 solved.");
47. Example coding problem 47.
// Code logic for problem 47
[Link]("Problem 47 solved.");
48. Example coding problem 48.
// Code logic for problem 48
[Link]("Problem 48 solved.");
49. Example coding problem 49.
// Code logic for problem 49
[Link]("Problem 49 solved.");
50. Example coding problem 50.
// Code logic for problem 50
[Link]("Problem 50 solved.");
51. Example coding problem 51.
// Code logic for problem 51
[Link]("Problem 51 solved.");
52. Example coding problem 52.
// Code logic for problem 52
[Link]("Problem 52 solved.");
53. Example coding problem 53.
// Code logic for problem 53
[Link]("Problem 53 solved.");
54. Example coding problem 54.
// Code logic for problem 54
[Link]("Problem 54 solved.");
55. Example coding problem 55.
// Code logic for problem 55
[Link]("Problem 55 solved.");
56. Example coding problem 56.
// Code logic for problem 56
[Link]("Problem 56 solved.");
57. Example coding problem 57.
// Code logic for problem 57
[Link]("Problem 57 solved.");
58. Example coding problem 58.
// Code logic for problem 58
[Link]("Problem 58 solved.");
59. Example coding problem 59.
// Code logic for problem 59
[Link]("Problem 59 solved.");
60. Example coding problem 60.
// Code logic for problem 60
[Link]("Problem 60 solved.");