Thursday Code Puzzler: Fibonacci Sequences
Thursday Code Puzzler: Fibonacci Sequences
Join the DZone community and get the full member experience.
Join For FreeGet the Edge with a Professional Java IDE. 30-day free trial.
Thursday is code puzzler day here at DZone. The idea is simple: solve the coding problem as efficiently as you can, in any language or framework that you find suitable.
Note: Even though there really is nothing stopping you from finding a solution to this on the internet, try to keep honest, and come up with your own answer. It's all about the participation!
Generate the nth Fibonacci Number
Today we'll tackle another classic CS problem, the Fibonacci sequence. The first two numbers in the sequence are 0 and 1, and each subsequent number is the sum of the previous two. So, it looks like
0,1,1,2,3,5,8,13,21 ......
What you have to do is provide a function that takes a parameter n that returns the Fibonacci number at the nth position.
Catch up on all our previous puzzlers here
Get the Java IDE that understands code & makes developing enjoyable. Level up your code with IntelliJ IDEA. Download the free trial.
Like This Article? Read More From DZone
Opinions expressed by DZone contributors are their own.
{{ parent.title || parent.header.title}}
{{ parent.tldr }}
{{ parent.linkDescription }}
{{ parent.urlSource.name }}