learn kro favicon img

Day 9: Recursion 3 | HackerRank Solution

Hello coders, today we are going to solve Day 9: Recursion 3 HackerRank Solution in C, C++ and Java.


Today, we are learning about an algorithmic concept called recursion.

Function Description
Complete the factorial function in the editor below. Be sure to use recursion.

factorial has the following paramter:

  • int n: an integer


  • int: the factorial of n

Note: If you fail to use recursion or fail to name your recursive function factorial or Factorial, you will get a score of 0.

Input Format

A single integer, n (the argument to pass to factorial).


  • 2 <= n <= 12
  • Your submission must contain a recursive function named factorial.

Sample Input

Sample Output


Consider the following steps. After the recursive calls from step 1 to 3, results are accumulated from step 3 to 1.

  1. factorial(3) = 3 x factorial(2) = 3 x 2 = 6
  2. factorial(2) = 2 x factorial(2) = 2 x 1 = 2
  3. factorial(1) = 1

Solution – Day 9: Recursion 3




Disclaimer: The above Problem (Day 9: Recursion 3) is generated by Hacker Rank but the Solution is Provided by Learnkro. This tutorial is only for Educational and Learning Purpose.

Leave a Comment

Your email address will not be published. Required fields are marked *