We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Tutorials
  3. 30 Days of Code
  4. Day 9: Recursion 3
  5. Discussions

Day 9: Recursion 3

Sort by

recency

|

1155 Discussions

|

  • yashdeora98294
     + 0 comments

    Here is Day 9 : Recursion 3 solution in Python, java, c++, c and javascript - https://programmingoneonone.com/hackerrank-day-9-recursion-3-30-days-of-code-solution.html

  • ranjithkumar1353
     + 0 comments

    JAVA

    if(n==0||n==1){ return 1; } else{ return n* factorial(n-1); }

  • fran_delgado_ca1
     + 0 comments

    JS

    function factorial(n) {
    return n === 1 ? 1 : n * factorial(n-1);
}

  • sivaram_movva1
     + 0 comments

    c#

    public static int factorial(int n)

    {

                return n>1?n*factorial(n-1):1;

    }

  • siangba_manga_m1
     + 0 comments

    Python : 

    def factorial(n):
    return 1 if n<=1 else n*factorial(n-1)