Skip to main content

Day 9: Recursion 3 | HackerRank | solution in python

Objective 

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

Returns

  • int: the factorial of 

Note: If you fail to use recursion or fail to name your recursive function factorial or Factorial

you will get a score of .

Input Format

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

Constraints


  • Your submission must contain a recursive function named factorial.

Sample Input

3

Sample Output

6
#PROGRAM IN PYTHON 
import math
import os
import random
import re
import sys
# Complete the factorial function below.
def factorial(n):
    if n==0 or n==1:
        return 1
    else:
        return n*factorial(n-1) 

if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')

    n = int(input())

    result = factorial(n)

    fptr.write(str(result) + '\n')

    fptr.close()

Input :

3

Output :

6

Comments

Popular posts from this blog

Day 3: Intro to Conditional Statements | HackerRank | solution in python

Objective In this challenge, we learn about conditional statements. Check out the Tutorial tab for learning materials and an instructional video. Task Given an integer,  , perform the following conditional actions: If   is odd, print  Weird If   is even and in the inclusive range of   to  , print  Not Weird If   is even and in the inclusive range of   to  , print  Weird If   is even and greater than  , print  Not Weird Complete the stub code provided in your editor to print whether or not   is weird. Input Format A single line containing a positive integer,  . Constraints Output Format Print  Weird  if the number is weird; otherwise, print  Not Weird . Sample Input 0 3 Sample Output 0 Weird Sample Input 1 24 Sample Output 1 Not Weird Explanation Sample Case 0:    is odd and odd numbers are weird, so we print  Weird . Sample Case 1: ...

Python Addition | Substration | Multiplication | Division | Modulous | in python

Addition (+)  Substraction (-)  Multiplication (*)  Division (/)(//)  Modulus (%)   Input :  first num 20 second num 10 Output :  Addition is  30 substraction is  10 multiplication is 200 float division  2.0 integer division  2 remainder is  0 PROGRAM IN PYTHON num1=int(input("first num ")) num2=int(input("second num ")) #sum of two numbers sum_of_two = num1 + num2 print("Addition is ",sum_of_two) #substitution of two sub_of_two = num1 - num2 print("substitution is ",sub_of_two) #multiplication of two nums sub_of_two = num1 * num2 print("multiplicatio is ",sub_of_two ) #division of two nums div_of_two1 = num1 / num2 #float division div_of_two2 = num1 // num2 #integer division print("float division ",div_of_two1) print("integer division ",div_of_two2) #modulus of two mod_of_two = num1 % num2 print("remainder is ",mod_of_two) output IN PYTHON first num 20 second num 10 Addition is 30 substitution is...

Day 10: Binary Numbers | HackerRank | solution in python

Objective Today, we're working with binary numbers. Task Given a base-  integer,  , convert it to binary (base- ). Then find and print the base-  integer denoting the maximum number of consecutive  's in  's binary representation. When working with different bases, it is common to show the base as a subscript. Example The binary representation of  ...