LeetCode 104 - Maximum Depth of a Binary Tree in Python

📖Description
Hello everyone! "Leetcode in Python" is a series where I explain all solutions to popular leetcode problems. Each video contains a theoretical section (where I explain the reasoning behind the most optimal solution) and a practical section (where I go over the Python solution). Solving these leetcode problems has helped me land interviews and job offers from FAANG. Stay tuned to learn how to crack (nearly) any coding interview.

In today's "LeetCode in Python" episode, I will be going over the 104th LeetCode problem: Maximum Depth of a Binary Tree. Please leave a like if you enjoyed the content, and subscribe if you would like to learn more about popular LeetCode problems asked during coding interviews. Thanks, and have a good one!

📝Note
Feel free to watch this video at 1.25 - 1.5 speed as I go through the solution(s) pretty slowly.

⏳Timestamps
00:17 Problem
00:52 Algorithm
06:55 Complexity
08:05 Python Code

💻Resources
Code: https://github.com/SuboptimalEng/
LeetCode: https://leetcode.com/problems/maximum-depth-of-binary-tree/

🎶Music
Joakim Karud, Canals: https://soundcloud.com/joakimkarud/canals-chilihop-essentials-summer-2016

#suboptimal #leetcode #python

Видео LeetCode 104 - Maximum Depth of a Binary Tree in Python канала Suboptimal Engineer