7 kyu
Simple fibonacci strings
663 of 2,193KenKamau
Description:
Given that
f0 = '0'
f1 = '01'
f2 = '010' = f1 + f0
f3 = '01001' = f2 + f1
You will be given a number and your task is to return the nth fibonacci string. For example:
solve(2) = '010'
solve(3) = '01001'
More examples in test cases. Good luck!
If you like sequence Katas, you will enjoy this Kata: Simple Prime Streaming
Algorithms
Similar Kata:
Stats:
| Created | Mar 10, 2018 |
| Published | Mar 10, 2018 |
| Warriors Trained | 3674 |
| Total Skips | 25 |
| Total Code Submissions | 4645 |
| Total Times Completed | 2193 |
| JavaScript Completions | 829 |
| Python Completions | 663 |
| Ruby Completions | 92 |
| Haskell Completions | 93 |
| C++ Completions | 172 |
| C# Completions | 116 |
| Java Completions | 261 |
| Go Completions | 93 |
| Total Stars | 49 |
| % of votes with a positive feedback rating | 91% of 554 |
| Total "Very Satisfied" Votes | 466 |
| Total "Somewhat Satisfied" Votes | 76 |
| Total "Not Satisfied" Votes | 12 |
| Total Rank Assessments | 5 |
| Average Assessed Rank | 7 kyu |
| Highest Assessed Rank | 7 kyu |
| Lowest Assessed Rank | 8 kyu |
