Calculate factorial of a number in Java using recursion

Carvia Tech | May 18, 2019 | 1 min read | 48 views | Java Coding Challenges

factorial (n) = n x (n-1) x (n-2) ... 1

public class Factorial {
    public int factorial(int n) {
        if (n == 1)
            return 1;
        else {
            return n * factorial(n - 1);
        }
    }
}

public int fact(int number) {
    int result = 1;
    while (number != 0) {
        result = result * number;
        number--;
    }
    return result;
}

Java Coding Challenges:

1. Check if the given string is palindrome
2. How to check if the given number is palindrome in Java
3. Check a number is Prime: Java Coding Problem
4. Check if the given number is Armstrong Number in Java
5. Java program to check if two strings are anagrams
6. Create anagram buckets from a given input array of words
7. Find two numbers of which the product is maximum in an array

Top articles in this category:

1. Top 50 SDET Java Programming Interview Questions & Answers
2. SDET: JUnit interview questions for automation engineer
3. Check if the given number is Armstrong Number in Java
4. Write a program to reverse a string using recursion in Java
5. Calculate Fibonacci Series in Java
6. Commonly used Http methods in RESTful services
7. How to reverse a number in Java

Find more on this topic:

SDET Interviews

SDET Java Interview pattern and collection of questions covering SDET coding challenges, automation testing concepts, functional, api, integration, performance and security testing, junit5, testng, jmeter, selenium and rest assured

Last updated 1 week ago

Recommended books for interview preparation:

You may also be interested in..

ebook PDF - Cracking Java Interviews v3.5 by Munish Chandel

You may also be interested in..

ebook PDF - Cracking Spring Microservices Interviews for Java Developers