Leetcode problem Longest Palindromic Substring (two solutions)

Показать описание

Subscribe for more educational videos on algorithms, coding interviews and competitive programming.

Рекомендации по теме

Комментарии

Your first statement made me crying for 2 hours straight

stanshen

I love your tutorials, how you go from the naive solution to the optimized one

youssefmuhamad

This is the beauty when someone red on codeforces solves interview problems. It was so easy for you Errichto, but for the sake of your audience you explained it thoroughly. Thanks :)

ashutoshmaheshwari

I just love how you go from the simplest to the most optimized solution and the way you explain the process for optimizing the code.

harshitmittal

Wow, no ads in any video.... This man is a legend

varunv

The small c++ optimizations you mentioned in this video will be really helpful for me while coding. Thanks for putting out content like these

BigFatSandwitch

Thank you brother from another mother, everyone on YouTube showing the code of optimised approach,
Only you showed the brute force

kettlebell_only

Love this! Because this is a simpler problem (comparing others in this channel) I could understand the proccess and I've got so many things to learn. Thank you!

kaiovieira

One Errichto video teach you a lot of extra things along with the actual solution.

Akshaykumar-blok

Great stuff, Errichto! There are far more successful YouTubers with a greater following. BUT I think you're way ahead of them in terms of material and quality content. Would love to see more videos like this. I think at the moment you're far under rated. Keep up the good work! 😀

dcodernz

My first thought was hashing.

It's possible to hash the string and hash the reversed string.

Then to find the longest palindrome, we can for every mid point (or double mid points for even length palindromes) iterate over it's prefixes and suffixes and compare them using hashes.

Now add binary search and we don't have to do that for every pref/suf length and just for O(logn) of them.

If I am not mistaken the total complexity would be O(n*logn)

sanfarans

Thanks for the explanation. I came to watch your video after I solved the problem myself. I was not disappointed because you explored many options. For N^2 time complexity what I did was reversed the original string and used longest common substring between the original string and the reversed string. I got an edge case where it was finding strings of length 2 to be palindrome even if they were not.

ShreyanGoswami

errichto makes me wanna leave programming and love programming at a same time..

RaGa_BABA

I wish you covered the Manacher's algorithm as well.

wedding_photography

Loved it, good job. One small observation, the string is a degenerate case for time in your algorithm. Instead of iterating mid in 0, 1, 2, 3, 4, you could iterate mid in n/2, n/2 + 1, n/2 - 1, n/2 + 2, n/2 - 2, ....
Then just check if mid is far enough away from the edges to make a possible new best. That puts you really close to O(n) .

CarrotCakeMake

You are awesooome, thank you. I love that you first write the naive solution and then explain and improve the code bit by bit :3

shahriardhruvo

I really appreciate your videos. I think the intuition behind how you derive the solution is outstanding. Helps a lot to understand how you came develop an approach.

achavan

I loved your way of breaking down the problem and gradually moving towards more optimized version. Would love your input on codechef problems from long challenge, cook off, lunchtime and various other categories of problem.

muskanagarwal

Thank you so much for these Leetcode tutorials. Absoultely love them !

atibhiagrawal

Your explanations of problems are awesome going from bruteforce approach to

raushankumarraman

Leetcode problem Longest Palindromic Substring (two solutions)

Longest Palindromic Substring - Python - Leetcode 5

Leetcode problem Longest Palindromic Substring (two solutions)

palindromes were tricky until I learned this

LeetCode 5. Longest Palindromic Substring (Algorithm Explained)

Most Asked FAANG Coding Question! | Longest Common Prefix - Leetcode 14

Microsoft Interview Question - Longest Palindromic Substring - LeetCode 5

Longest palindrome substring - LeetCode Interview Coding Challenge [Java Brains]

Longest Palindromic Sub-string (LeetCode 5) | Full solution with examples | Study Algorithms

Sliding Window Algorithm Explained Clearly | Longest Substring Without Repeating Characters Leetcode

LeetCode #5: Longest Palindromic Substring

Leetcode #5 - Longest Palindromic Substring (Solution)

Longest Palindromic Substring Manacher's Algorithm

Leetcode 5. Longest Palindromic Substring #java

Longest palindromic substring | Dynamic programming

#shorts Learn to solve LeetCode's Longest Palindromic Substring problem! 💻 solution explained...

Longest Palindromic Substring - LeetCode 5 - Blind 75 - Coding Interview

Longest Palindromic Substring - Leetcode 5 - Java

Leetcode - Longest Palindromic Substring (Python) (Revisited)

Leetcode - Longest Palindromic Substring (Python)

Leetcode - 5 : Longest Palindromic Substring | Solution Explained | Java

5. Longest Palindromic Substring - Day 19/31 Leetcode January Challenge

Longest Palindrome substring #leetcode #coding #leetcodedailychallenge #python #codeeasy #trending

Python Programming Practice: LeetCode #5 -- Longest Palindromic Substring

LeetCode 5. Longest Palindromic Substring | Longest Palindromic Substring LeetCode