-
This is the JUnit 5 solution to cover all kinds of inputs and outputs to check whether the given String is a Palindrome or not. This Unit test executes tests for the ‘StringPalindrome’ function available in the class ‘StringPalindromJunit5’.
-
This is the complete solution to find the String Palindrome check from the given String. The solution consists of a functional interface, super class and a couple of derived classes implementing the interface.
-
This is the JUnit 5 solution to cover all kinds of inputs and outputs to find the sum of the digits from a given number. This Unit test executes tests for the ‘SumDigits’ function available in the class ‘SumofDigitsJUnit’.
-
This is the complete solution to find the sum of digits from a given integer. The solution consists of a functional interface, super class and three derived classes implementing the interface.
-
This is the JUnit 5 solution to cover all kinds of inputs and outputs to find the Frequency of the numbers from an array of integers. This Unit test executes tests for the ‘RdInputArray’ function available in the class ‘FrequencyNumsJ8’.
-
This is the complete solution to find the frequency numbers from given array of the numbers This solution is designed to to solve the problem using an interface, super class and three derived classes implementing the interface.
-
This is the JUnit 5 solution to cover all kinds of inputs and outputs to find the leader numbers from an array of integers. This Unit test executes tests for the ‘RdInputArray’ function available in the class ‘LeaderNumsJ8’.
-
This is the complete solution to find the leader numbers from given array of the numbers This solution is designed to to solve the problem using an interface, super class and two derived classes implementing the interface.
-
This is the JUnit 5 solution to cover all kinds of inputs provided to find the Doublets whose sum divisible by 9 from an array of integers. This Unit test executes tests for the ‘ParseAnArrayInput’ function available in the class ‘DoubletsSumDivBy9J8’.
-
This is the complete solution to find the Doublets whose sum is divisible by 9. This solution is designed to to solve the problem using an interface, super class and two derived classes implementing the interface.
