Category: Prime number
-
How to write JUnit test code in Java for the for Primecheck function ?
This is the JUnit 5 solution to cover all kinds of inputs provided to PrimeCheck function. This Unit test executes tests for the ‘PrimeCheck’ function available in the class ‘PrimeJ8’.
-
How to check whether a given integer is prime number or not ?
This is the complete solution to check whether a given integer number is prime or not. This solution is designed to to solve the problem using an interface, super class and four derived classes implementing the interface. The core logic is to check the divisibility of the given number, from 2 to till the square…
-
How to find Missing Prime numbers from any given sequence of integers using Stream
This is the second solution to find the missing prime numbers from any given sequence of integers. This solution uses the Lambda expression with single abstract method. The solution also uses the range, filter, foreach methods of IntStream.
-
How to find Missing Prime numbers from any given sequence of integers
This is the first solution to find the missing prime numbers from any given sequence of integers. This solution uses the Lambda expression with single abstract method. The solution is finding all the missing prime numbers between every pair for consecutive numbers from the given sequence till end. The logic for prime check is the…
-
How to check whether a given integer is prime number or not
This is the third solution to check whether the given integer number is prime or not. This solution uses the Lambda expression with single abstract method. The implementation is to check the divisibility of the given number, from 2 to till the square root of the given number.
-
How to check whether a given integer is prime number or not
This is the second solution to find whether the given integer number is prime or not using a simple predicate and another core logic that no number is divisible by more than half of itself.
-
How to check whether a given integer is prime number or not
This is the first solution to find whether the given integer number is prime or not using the core logic, that is to check the divisibility of that number until the square root of that number.
Java Ice Breakers 