Longest Palindromic Substring O(N) Manacher's Algorithm | Leetcode - 5

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

Given a string, find the longest palindromic substring in this string in linear time.

To support us you can donate

Check out our other popular playlists:

If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful.

#coding #leetcode #programminglife #programmingisfun #programmer #tech #software #codinglife #leetcode
  1. Algorithms Made Easy
  2. leetcode
  3. Manacher
  4. Longest Palindromic Substring
  5. Interview Answers
  6. Manacher's Algorithm
Рекомендации по теме
Longest Palindromic Substring 0:16:46

Longest Palindromic Substring Manacher's Algorithm

Longest Palindromic Substring 0:08:11

Longest Palindromic Substring - Python - Leetcode 5

Longest Palindromic Substring 0:15:58

Longest Palindromic Substring O(N) Manacher's Algorithm | Leetcode - 5

LeetCode 5. Longest 0:14:40

LeetCode 5. Longest Palindromic Substring (Algorithm Explained)

Longest Palindromic Substring 0:23:49

Longest Palindromic Substring O(N) Manacher's Algorithm

palindromes were tricky 0:01:00

palindromes were tricky until I learned this

Manache's Algorithm | 0:29:16

Manache's Algorithm | Linear Time Longest Palindromic Substring

Longest palindromic substring 0:15:21

Longest palindromic substring | Dynamic programming

Manacher Algorithm for 0:38:05

Manacher Algorithm for Strings | Understanding, Proof and Implementation | Palindromes | VIvek Gupta

Leetcode problem Longest 0:25:19

Leetcode problem Longest Palindromic Substring (two solutions)

LeetCode Solution - 0:24:20

LeetCode Solution - 5.0 Longest Palindromic Substring | Manacher Algorithm 100% Beat

5. Longest Palindromic 0:16:37

5. Longest Palindromic Substring in LINEAR time - Manacher's Algorithm

Manacher's Algorithm | 0:14:53

Manacher's Algorithm | Longest Palindromic Substring | LeetCode 5 | O(n) Solution in Go

#shorts Learn to 0:00:12

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

Longest Palindromic Sub-string 0:10:01

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

Unlocking Manacher's Algorithm: 0:09:05

Unlocking Manacher's Algorithm: 5 Find Longest Palindromic Substring | Live Coding with vanAmse...

LeetCode Tutorial 5. 0:16:31

LeetCode Tutorial 5. Longest Palindromic Substring

Longest Palindromic Substring 0:08:33

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

Leetcode 5 'Longest 0:29:44

Leetcode 5 'Longest Palindromic Substring' | Manacher's Algorithm O(n) | Google Inter...

5. Longest Palindromic 0:21:14

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

Solving Longest Palindromic 1:21:08

Solving Longest Palindromic Substring with Manacher's Algorithm | Intermediate Algorithm Traini...

Longest palindrome substring 1:01:33

Longest palindrome substring | leetcode - 5 | harishnote

LeetCode 5 | 0:23:19

LeetCode 5 | Longest Palindromic Substring | Manacher's Algorithm |Strings | C++[ Algorithm + C...

Longest Palindromic Substring 0:39:14

Longest Palindromic Substring - Leetcode 5 - C#

Комментарии
Автор

We hope you all are enjoying our videos!!! Don't forget to leave a comment!!! Please like the video to support us!!!

Questions you might like:

Struggling in a question??

Leave in a comment and we will make a video!!!🙂🙂🙂

AlgorithmsMadeEasy
Автор

At times I wonder why learn this algorithm. I don't know why I need to find a palindrome at work.

Kidkromechan
Автор

At 6:38, how did P[mirror] become zero? p[mirror] was 2 before it and r-i should be 1, right?

manumathew
Автор

12:37 umm where did you define this variable r???

anonymousperson
Автор

Thank you sir for precious explanation

kanhamishra
Автор

is it good to use this approach in interview? or we can leave this problem till O(Nsquare) time complexity?

sumit_verma
Автор

Very Clear Explaination Via That Left And Right Pointer .. Thanks

TheIndianChroniclee
Автор

public String longestPalindrome(String s)
{
int n=s.length();
char[] newStr=new char[2*n+1];
int i=0;
newStr[i++]='#';
for(char c:s.toCharArray())
{
newStr[i++]=c;
newStr[i++]='#';
}
int p[]=new int[2*n+1];
int center=0, right=0;
int longestLenght=0, longestCenter=0;
for (i = 0; i <newStr.length; i++)
{
int mirror=2*center-i;
if(right>i)
{
p[i]=Math.min(p[mirror], right-i);
}
int a=i+(p[i]+1);
int b=i-(p[i]+1);


{
b--;
a++;
p[i]++;
}
if(p[i]>=longestLenght)
{
longestCenter=i;
longestLenght=p[i];
}
if(i+p[i]>right)
{
center=i;
right=i+p[i];
}
}
String st=new String(newStr);
return st.substring(longestCenter-longestLenght, longestCenter+longestLenght).replace("#", "");
}

AmritAgarwal
Автор

how did u get it. why are you starting off in the middle?

abhigyanraha
Автор

Hi sir the git link which you provided it is not working got "not found"
The way of explanation is awesome.

skfiroz
Автор

remove line no 11 ===>newStr[i]='#';

AmritAgarwal
Автор

Sir i can not understand with are you saying, maybe talk slower. India accent is indeed on another level.

TLDZ-sm
Автор

pehle ek acha sa mic khareed lo uske baad gyaan baatna

jatinbhatoya
welcome to shbcf.ru