id/email
password
forgot password | create account
about | help | code help+videos | done | prefs
CodingBat code practice

 

simona1@sfusd.edu recursion1 > fibonacciWord
prev  |  next  |  chance

The first two fibonacciWords are "b" and "a." The third fibonacciWord is "ab" which is the concatenation of the two previous fibonacciWords. Each successive fibonacciWord is the concatenation of the previous two. The fibonacciWords are "b", "a", "ab", "aba", "abaab", "abaababa", and so on.


fibonacciWord(0) → "b"
fibonacciWord(1) → "a"
fibonacciWord(2) → "ab"

...Save, Compile, Run (ctrl-enter)

public String fibonacciWord(int n){ }

Editor font size %:
Shorter output


Forget It! -- delete my code for this problem

Progress graphs:
 Your progress graph for this problem
 Random user progress graph for this problem
 Random Epic Progress Graph

Java Help

Misc Code Practice

Difficulty: 290

Copyright Nick Parlante 2017 - privacy