## Algorithm

Problem Name: Java Lambda Expressions

In this HackerRank Functions in Java programming problem solution,

This Java 8 challenge tests your knowledge of Lambda expressions!

Write the following methods that return a lambda expression performing a specified action:

1. PerformOperation isOdd(): The lambda expression must return true if a number is odd or false if it is even.
2. PerformOperation isPrime(): The lambda expression must return true if a number is prime or false if it is composite.
3. PerformOperation isPalindrome(): The lambda expression must return true if a number is a palindrome or false if it is not.

Input Format

Input is handled for you by the locked stub code in your editor.

Output Format

The locked stub code in your editor will print T lines of output.

Sample Input

The first line contains an integer, T (the number of test cases). The T subsequent lines each describe a test case in the form of 2 space-separated integers:

The first integer specifies the condition to check for ( 1 for Odd/Even, 2 for Prime, or 3 for Palindrome). The second integer denotes the number to be checked.

``````5
1 4
2 5
3 898
1 3
2 12
``````

Sample Output

``````EVEN
PRIME
PALINDROME
ODD
COMPOSITE
``````

## Code Examples

### #1 Code Example with Java Programming

```Code - Java Programming```

``````
import java.io.*;
import java.util.*;
interface PerformOperation {
boolean check(int a);
}
class MyMath {
public static boolean checker(PerformOperation p, int num) {
return p.check(num);
}

public static PerformOperation is_odd() {
return n -> (n & 1) == 1;
}

public static PerformOperation is_prime() {
// O(n^(1/2)) runtime
return n -> {
if (n  <  2) {
return false;
}
int sqrt = (int) Math.sqrt(n);
for (int i = 2; i  < = sqrt; i++) {
if (n % i == 0) {
return false;
}
}
return true;
};
}

public static PerformOperation is_palindrome() {
return n -> {
String original = Integer.toString(n);
String reversed = new StringBuilder(Integer.toString(n)).reverse().toString();
return original.equals(reversed);
};
}
}

public class Solution {
public static void main(String[] args) throws IOException {
MyMath ob = new MyMath();
PerformOperation op;
boolean ret = false;
String ans = null;
while (T--> 0) {
StringTokenizer st = new StringTokenizer(s);
int ch = Integer.parseInt(st.nextToken());
int num = Integer.parseInt(st.nextToken());
if (ch == 1) {
op = ob.is_odd();
ret = ob.checker(op, num);
ans = (ret) ? "ODD" : "EVEN";
} else if (ch == 2) {
op = ob.is_prime();
ret = ob.checker(op, num);
ans = (ret) ? "PRIME" : "COMPOSITE";
} else if (ch == 3) {
op = ob.is_palindrome();
ret = ob.checker(op, num);
ans = (ret) ? "PALINDROME" : "NOT PALINDROME";
}
System.out.println(ans);
}
}
}
``````
Copy The Code &