Programming Course

Python Course

0.0064 seconds

EN | RU

Implement Data Structures

Problem	Difficulty	Status
Find the N-th Fibonacci Number		Not Completed
Find the N-th Fibonacci Number - Recursive Approach		Not Completed
Reverse a String		Not Completed
Find Maximum in a List		Not Completed
Sum of Elements in a List		Not Completed
Find Duplicates in a List		Not Completed
Merge Two Sorted Lists		Not Completed
Count Frequency of Elements		Not Completed

Question
Clues from AI
Submissions

Find the N-th Fibonacci Number

The Fibonacci sequence is a series of numbers where each number is the sum of the two preceding ones, starting from 0 and 1. Your task is to write a function (def getNthFib(n)) that returns the N-th Fibonacci number efficiently.

main.py

                            def getNthFib(n):
    lastTwo = [0, 1]
    counter = 3
    while counter <= n:
        nextFib = lastTwo[0] + lastTwo[1]
        lastTwo[0] = lastTwo[1]
        lastTwo[1] = nextFib
        counter += 1
    return lastTwo[1] if n > 1 else lastTwo[0]

print(getNthFib(8))
                        

                                
                            

                                Running...
                            