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.
  • HackerRank Home

    HackerRank

  • |
  • Prepare
  • Certify
  • Compete
  • Hiring developers?
  1. Recursion: Fibonacci Numbers
  2. Discussions

Recursion: Fibonacci Numbers

Problem
Submissions
Leaderboard
Discussions
Editorial
Topics

Sort 287 Discussions, By:

recency

Please Login in order to post a comment

  • nguyenlehuyuit
    2 months ago+ 0 comments

    php

    function fibonacci($n, $result = [0,1]) {
        if (isset($result[$n])) {
            return $result[$n];
        }
        
        $length = count($result);
        $result[] = $result[$length - 1] + $result[$length - 2];
    
        return fibonacci($n, $result);
    }
    
    0|
    Permalink
  • 1641530038_AIML
    3 months ago+ 0 comments

    O(N) time and O(N) space dynamic solution.

    def fibonacci(n,dp):
        if dp[n]!=-1:
            return dp[n]
        
        dp[n] = fibonacci(n-1,dp)+fibonacci(n-2,dp)
        return dp[n]
    
    n = int(input())
    dp = [-1]*(n+1)
    dp[0] = 0
    dp[1] = 1
    print(fibonacci(n,dp))
    
    0|
    Permalink
  • guptap8265
    4 months ago+ 0 comments

    def fibonacci(n):

    p = 0
    c = 1
    
    for i in range(1,n):
        k = c
        c = p+c
        p = k
    return c 
    
    0|
    Permalink
  • jorgeavanzado
    4 months ago+ 0 comments
    def fibonacci(n):
        if n == 1 or n == 2:
            return 1
        elif n > 2:
            return fibonacci(n-1) + fibonacci(n-2)
    
    n = int(input())
    print(fibonacci(n))
    
    0|
    Permalink
  • h2200031212
    5 months ago+ 0 comments

    c language (easy)

    include

    int fibo(int num) { if(num==0||num==1) return num; else return fibo(num-1)+fibo(num-2);

    } int main() { int n; scanf("%d",&n); printf("%d",fibo(n)); return 0; }

    -2|
    Permalink
Load more conversations

Need Help?


View editorial
View top submissions
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy