Conquer the JavaScript Interview: Fibonacci Sequence [Beginner Skill Level]

Link to this Playlist:

This is a part of my Algorithms and Data Structures playlist series. We cover a lot of common interview questions asked during whiteboards for entry level developers. Learning to master these takes time, practice, and pattern recognition. So I'll be helping you equip a toolbelt and filling it with as many tools as I can to help prepare you crush those interviews! Remember: "Luck is where practice meets opportunity."

In this video we cover a classic beginner question: the Fibonacci Sequence! We use recursion to call the previous two positions in the sequence in order to find the value of the position in the sequence we're looking for. And then the recursion begins and continues until the whole sequence is built and added up with function calls and finally returns our value to us!

Don't forget to like this video and subscribe to our channel – we're publishing more videos and walkthroughs every week. Comment below and let us know what you'd like to see next!