In this episode of Python Programming Practice, we tackle LeetCode #509 -- Fibonacci Number:
https://leetcode.com/problems/fibonacci-number/


The Fibonacci sequence is a sequence of numbers where each number is equal to the sum of the two numbers before it in the sequence. We are also given that the 0th Fibonacci number is 0 and the 1st Fibonacci number is 1.

Writing a function to find Fibonacci numbers is a common motivating example for learning about recursion in introductory programming courses.

This is an easy difficulty problem, so a naive approach like the basic recursive solution will work, but there will generally be faster solutions.

If you don't know Python, you can learn the basics of Python for data analysis using this guide I created on Kaggle: https://www.kaggle.com/hamelg/python-for-data-analysis-index

Python Programming Practice is a series focused on teaching practical coding skills by solving exercises on popular coding websites. Note that the solutions seen here may not be the most efficient possible.

I am not going to provide the full code in the video description for this series, since copy and pasting solutions is not in the spirit of doing coding exercises. It is intended that the video will help you think about problems, approaches and how to structure solutions so that you are able to code up a working solution yourself. .


⭐ Kite is a free AI-powered coding assistant that integrates with popular editors and IDEs to give you smart code completions and docs while you’re typing. It is a cool application of machine learning that can also help you code faster! Check it out here: https://www.kite.com/get-kite/?utm_medium=referral&utm_source=youtube&utm_campaign=datadaft&utm_content=description-only