search

SarthakKeshari / Java-Questions-and-Solutions

This repository aims to solve and create new problems from different spheres of coding. A path to help students to get access to solutions and discuss their doubts.
MIT License
47 stars 98 forks source link

Fibonacci Number #413

Open nik132-eng opened 3 years ago

nik132-eng commented 3 years ago

Enter your question -

The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is,

F(0) = 0, F(1) = 1 F(n) = F(n - 1) + F(n - 2), for n > 1. Given n, calculate F(n).

Enter link to the question(if question belongs to any online platform) -

https://leetcode.com/problems/fibonacci-number/

Tags for the question(eg - Array, Basic, Stack, etc.) -

maths, DP

nik132-eng commented 3 years ago

kindly assign me for practice.

SarthakKeshari commented 3 years ago

@nik132-eng, Kindly add your solution to "leetcode" folder. Deadline - 13/10/2021

This Issue will only be counted towards ranking criteria of this repository.

Gentle advice- A bit more tough questions would be appreciated for Hacktoberfest tag.