LeetCode 5. Longest Palindromic Substring [Algorithm + Code Explained ]

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

One of the most frequently asked coding interview questions on String in companies like Google, Facebook, Amazon, LinkedIn, Microsoft, Uber, Apple, Adobe etc.

LeetCode : Longest Palindromic Substring

Question Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.
Example:

Input: "babad"
Output: "bab"
Note: "aba" is also a valid answer.

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

Комментарии

i think out of the bunch of explanations out there, yours is the best in terms of converting the thought to actual code, thanks a lot for doing this.

arnabchatterjee

Mam how did you prepare for dynamic programming,

AmanSharma-vbjl

I think we can improve on this by breaking the loop if 'i' and 'len' is greater than half of the length of the string.

leos_abraham

Hey Jayati,
This video is awsome, thank you for the hard work you have put in.
But in an interview, an interviewer asked me to solve it in O(n) time complexity, although i have solved it in O(n*n) . If you can create video to solve in O(n), then it will be highly appreciable.

hiteshgupta

amazing explanation, I am learning from you how to explain my interviewer

vaishnavikulkarni

Awesome explaination, also waiting for the explaination of Manacher's Algorithm

YogeshSharma-btxl

you just copy pasted the solution from the editorial, very helpful

tsupreetsingh

Whole video as well as code is same like Prakash Shukla video😂😂 try somethig new

deepjyotidebnath

LeetCode 5. Longest Palindromic Substring [Algorithm + Code Explained ]

Longest Palindromic Substring - Python - Leetcode 5

LeetCode 5. Longest Palindromic Substring (Algorithm Explained)

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

palindromes were tricky until I learned this

LeetCode #5: Longest Palindromic Substring

Longest Palindromic Substring | LeetCode 5 | C++, Java, Python

LONGEST PALINDROMIC SUBSTRING | LEETCODE # 5 | PYTHON SOLUTION

Longest Palindromic Substring | Live Coding with Explanation | Leetcode - 5

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

Longest Palindromic Substring Python Solution - LeetCode #5

Leetcode 5. Longest Palindromic Substring

Microsoft Interview Question - Longest Palindromic Substring - LeetCode 5

Longest Palindromic Substring - LeetCode 5 - Python

Собеседование в IT | LeetCode | 5. Longest Palindromic Substring

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

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

5. Longest Palindromic Substring - LeetCode Python Solution

Leetcode 5. Longest Palindromic Substring #java

8. Longest Palindromic Substring | Leetcode 5 | Strings | Odd and even length approach

5. Longest Palindromic Substring | Day 001 | Brute - Better - Optimal | 2 Pointers | DP

Leetcode problem Longest Palindromic Substring (two solutions)

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

LeetCode 5. Longest Palindromic Substring [Algorithm + Code Explained ]

Leetcode - Longest Palindromic Substring (Python) (Revisited)