-
This is the first solution to check whether a string can be formed as a palindrome. This approach uses the core logic to check the criteria for the palindrome.
-
This is the second solution to find the nTh number of the Fibonacci series using recursion approach.
-
This is the first solution to find the nTh number of the Fibonacci series.
-
This is the first solution to print the Floyd’s Triangle. The program expects the number of rows as input from the user. The logic displays that many number of rows as per the Floyd’s Triangle pattern of numbers in each row.
-
This is the third solution to find the factorial of long integer value. This solution uses the recursion approach. The recursive function should have an exit condition to stop function calling itself infinite number of times.
-
This is the second solution to check the number for Disarium. This solution contains the core logic to evaluate the sum of powers of all digits in descending order of the length of number. The Disarium number is say for a given number 351, evaluate the powers from the left side as power (3 *
-
This is the second solution to check the number for Armstrong. This solution contains the core logic to extract each digit from the given number, in parallel it will compute the sum of the cubes of each digit. The Armstrong number is say for a given number 153, evaluate the powers of cubes from any
-
This is the second solution to extract characters and numbers from an alpha numeric value into separate strings. This program scans each character and checks ASCII range of alphabets, and numbers.
-
This is the first solution to check the number for Armstrong. This solution uses String class, and a couple of Character functions to evaluate the sum of the cubes of each digit in a given number. The Armstrong number is say for a given number 153, evaluate the powers of cubes from any side as
-
This is the first solution to find array triplets, with sum of any two numbers equals with any other element in the same array.
Java Ice Breakers 