Java Lambda Expressions | HackerRank Solution

Hello coders, today we are going to solve Java Lambda Expressions HackerRank Solution.

Problem

This Java 8 challenge tests your knowledge of Lambda expressions!

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

• PerformOperation isOdd(): The lambda expression must return true if a number is odd or false if it is even.
• PerformOperation isPrime(): The lambda expression must return true if a number is prime or false if it is composite.
• 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

Solution – Java Lambda Expressions

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);
 }

   // Write your code here
 
 public PerformOperation isOdd() {
  return (a) -> {
   return (a % 2 == 1);
  };
 }
 public PerformOperation isPrime() {
  return (a) -> {
   for (int i = 2; i <= a / 2; i++) {
    if (a % i == 0)
     return false;
   }
   return true;
  };
 }
 public PerformOperation isPalindrome() {
  return (a) -> {
   int rev = 0;int r = 0;int n = a;
   while (n != 0) {
    r = n % 10;
    rev = rev * 10 + r;
    n /= 10;
   }
   return (rev == a);
  };
 }
}


public class Solution {

 public static void main(String[] args) throws IOException {
  MyMath ob = new MyMath();
  BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  int T = Integer.parseInt(br.readLine());
  PerformOperation op;
  boolean ret = false;
  String ans = null;
  while (T--> 0) {
   String s = br.readLine().trim();
   StringTokenizer st = new StringTokenizer(s);
   int ch = Integer.parseInt(st.nextToken());
   int num = Integer.parseInt(st.nextToken());
   if (ch == 1) {
    op = ob.isOdd();
    ret = ob.checker(op, num);
    ans = (ret) ? "ODD" : "EVEN";
   } else if (ch == 2) {
    op = ob.isPrime();
    ret = ob.checker(op, num);
    ans = (ret) ? "PRIME" : "COMPOSITE";
   } else if (ch == 3) {
    op = ob.isPalindrome();
    ret = ob.checker(op, num);
    ans = (ret) ? "PALINDROME" : "NOT PALINDROME";

   }
   System.out.println(ans);
  }
 }
}

Disclaimer: The above Problem ( Java Lambda Expressions ) is generated by Hacker Rank but the Solution is Provided by CodingBroz. This tutorial is only for Educational and Learning Purpose.