LeetCode 02 - Add Two Numbers Recursively in Python (Linked Lists)

📖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 numerous companies like Amazon (SWE offer), Goldman Sachs (SWE offer), and Google (onsite + colossal failure). Stay tuned to learn how to crack (nearly) any coding interview

In today's "Leetcode in Python" episode, I will be going over the recursive version of Add Two Numbers. It is a popular question asked by many top tech companies like Amazon, Google, and Facebook. 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 solutions pretty slowly.

⏳Timestamps 00:00 Add two numbers problem statement analysis 01:32 Walkthrough of example 02:57 Recursive algorithm 08:16 Time/Space complexity - Big O 10:45 Understanding the code 16:12 Example with code

💻Resources Code: https://github.com/SuboptimalEng Leetcode: https://leetcode.com/problems/add-two-numbers/

#addtwonumbers #leetcode #python ... https://www.youtube.com/watch?v=G6X7Fn2IDPE