Uploaded March 2020 | Updated November 2026, 1 hour ago
In this episode of Python Programming Practice, we tackle LeetCode #509 -- Fibonacci Number:
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: 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: kite.com/get-kite/?utm_medium=referral&utm_source=youtube&utm_campaign=datadaft&utm_content=description-only
In this episode of Python Programming Practice, we tackle LeetCode #509 -- Fibonacci Number:
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: 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: kite.com/get-kite/?utm_medium=referral&utm_source=youtube&utm_campaign=datadaft&utm_content=description-only






![How To Flatten Nested Lists in Python
↓ Code Available Below! ↓
This video shows how to flatten nested lists in Python.
If you find this video useful, like, share and subscribe to support the channel!
► Subscribe: https://www.youtube.com/c/DataDaft?sub_confirmation=1
Code used in this Python Code Clip:
nested = [[1,2,3],[4,5,6],[7,8,9]]
# Depth 2 flatten with list comprehension
flattened = [num for sublist in nested for num in sublist]
print(flattened)
# Depth 2 flatten with for loops
flattened2 = []
for sublist in nested:
for num in sublist:
flattened2.append(num)
print(flattened2)
# Flatten with numpy
import numpy as np
np.array(nested).flatten()
# Nested lists greater than depth 2
nested3 = [nested, nested]
# Flatten depth 3 nested with numpy
import numpy as np
np.array(nested3).flatten()
# Add extra sublists as extra loops:
[num for sub1 in nested3 for sub2 in sub1 for num in sub2]
# Flatten lists with unequal levels of nesting
unequal_nest = [1 , [2, 3], [[4,5],[6, 7]]]
def flatten_list(x):
for item in x:
if type(item) in [list]:
for num in flatten_list(item):
yield(num)
else:
yield(item)
list(flatten_list(unequal_nest))
* Note: YouTube does not allow greater than or less than symbols in the text description, so the code above will not be exactly the same as the code shown in the video! I will use Unicode large < and > symbols in place of the standard sized ones. .
⭐ 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 How To Flatten Nested Lists in Python](https://i.ytimg.com/vi/p9Cp5w2HV7g/mqdefault.jpg)

![How to Check the First and Last Rows of a Data Frame in Pandas (Python)
↓ Code Available Below! ↓
This video shows how to check the first and last rows of pandas data frame using the both the built in head and tail functions as well as index slicing with iloc. Checking the head and tail of a data frame is a common operation to get a sense of what your data looks like and avoid printing too many rows to the console. It is also a quick way of getting the top n results from a sorted data frame.
If you find this video useful, like, share and subscribe to support the channel!
► Subscribe: https://www.youtube.com/c/DataDaft?sub_confirmation=1
Code used in this Python Code Clip:
import pandas as pd
import statsmodels.api as sm #(To access mtcars dataset)
mtcars = sm.datasets.get_rdataset(mtcars, datasets, cache=True).data
# Check the first n rows with df.head(n)
# Equivalent to df.iloc[0:n]
mtcars.head(6)
# Check the last n rows with df.tail(n)
# Equivalent to df.iloc[len(df)-n:len(df)]
mtcars.tail(6)
* Note: YouTube does not allow greater than or less than symbols in the text description, so the code above will not be exactly the same as the code shown in the video! I will use Unicode large < and > symbols in place of the standard sized ones. .
⭐ 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 How to Check the First and Last Rows of a Data Frame in Pandas (Python)](https://i.ytimg.com/vi/r5JcWGIfgBg/mqdefault.jpg)

