Retired
Fibonacci Sequence (retired)
78Fowlron
Description:
The fibonacci sequence is a sequence where each term is generated by adding up the 2 previous terms. The fibonacci sequence can start with (1, 1) or (0, 1). In this test we assume it starts with (1, 1) For example, up to the 10th term:
1, 1, 2, 3, 5, 8, 13, 21, 34, 55...
Your function must return the nth term of the sequence.
Algorithms
Mathematics
Logic
Numbers
Sequences
Arrays
Data Types
Similar Kata:
Stats:
| Created | Aug 27, 2014 |
| Warriors Trained | 155 |
| Total Skips | 18 |
| Total Code Submissions | 268 |
| Total Times Completed | 78 |
| Python Completions | 78 |
| Ruby Completions | 0 |
| Total Stars | 1 |
| % of votes with a positive feedback rating | 0% of 0 |
| Total "Very Satisfied" Votes | 19 |
| Total "Somewhat Satisfied" Votes | 0 |
| Total "Not Satisfied" Votes | 2 |
