Nth Fibonacci AlgoExpert Intro The Fibonacci sequence is defined as follows: the first number in the sequence is 0, the second is 1, and the nth number is the sum of (n-1)th and (n-2)th numbers. Write a function that takes in an integer n and returns...

6 min read

·

101 views

5 min read

4 followers

Head in the clouds, playing with Kubernetes, infrastructure as code, and automation.

Subscribe to my newsletter and never miss my upcoming articles