LeetCode 05 - Longest Palindromic Substring in Python

⚠️Warning I must be the dumbest software boi on the planet cause I realized after uploading my video that my Mac was revving super hard in some parts of my voice recordings. Sorry about that; will fix it next time.

📖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 Longest Palindromic Substring. 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:07 Problem statement 00:17 Examples 00:47 Brute Force Solution 01:40 Space/Time Complexity 02:18 Fast Solution 03:13 Space/Time Complexity 04:17 Code

💻Resources Code: https://github.com/SuboptimalEng/ Leetcode: https://leetcode.com/problems/longest-palindromic-substring/

#leetcode #python #longestPalindromicSubstring ... https://www.youtube.com/watch?v=xYBKMV92YrM