- Write a function called fibonacci which receives a lon “n” and returns a long which is the value of the nth number in the fibonacci series which is: 0,1,1,2,3,5,8,13,21,34,55,89……….
So, fibonacci(0) woud return 0, fibonacci(5) would return 5, fibonacci(8) would return 21.
Note that the first two fibonacci numbers are 0 and 1.
All others are the sum of the previous two fibonacci numbers.
GitHub link to question 1 answer.
- Write a function called isPalindrome which receives a string “x” and returns true if the string x is a palindrome, otherwise false.
GitHub link to question 2 answer