Longest Palindromic Substring Dynamic Programming | Explanation with Code

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

NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this video, we discuss the problem Longest Palindromic Substring using dynamic programming in JAVA. In this problem,

1. You are given a string string.
2. You are required to print the length of longest of palindromic substrings in string string.

#dp #lps #dynamicprogramming

  1. Pepcoding
  2. pepcoding
  3. longest palindromic substring
  4. longest palindromic substrings dp
  5. longest palindromic substrings dynamic programming
  6. longest palindromic substring leetcode
Рекомендации по теме
Longest palindromic substring 0:15:21

Longest palindromic substring | Dynamic programming

Longest Palindromic Subsequence 0:04:33

Longest Palindromic Subsequence | Dynamic Programming | Set 12 | GeeksforGeeks

Longest Palindromic Substring 0:08:11

Longest Palindromic Substring - Python - Leetcode 5

palindromes were tricky 0:01:00

palindromes were tricky until I learned this

E004 : Longest 0:08:52

E004 : Longest Palindromic Substring | Dynamic Programming | CodeNCode

Longest Palindromic Subsequence 0:09:18

Longest Palindromic Subsequence

LeetCode 5. Longest 0:14:40

LeetCode 5. Longest Palindromic Substring (Algorithm Explained)

DP-10: Longest Palindromic 0:37:58

DP-10: Longest Palindromic Substring

Longest Palindromic Substring 0:18:08

Longest Palindromic Substring - LeetCode #5 | Dynamic Programming - Python

LeetCode 5. Longest 0:16:07

LeetCode 5. Longest Palindromic Substring， Dynamic Programming Python

Longest Palindromic Substring 0:11:45

Longest Palindromic Substring Dynamic Programming | Explanation with Code

Longest Palindromic Substring 0:16:46

Longest Palindromic Substring Manacher's Algorithm

Longest Palindromic Sub-string 0:10:01

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

Leetcode problem Longest 0:25:19

Leetcode problem Longest Palindromic Substring (two solutions)

Leetcode : Longest 0:14:41

Leetcode : Longest Palindromic Subsequence (Dynamic Programming)

Longest Palindromic Subsequence 0:25:22

Longest Palindromic Subsequence and it's Length (ALGORITHM -DYNAMIC PROGRAMMING)

Dynamic Programming (Q&A 0:23:01

Dynamic Programming (Q&A -1 ): - Longest Palindromic Subsequence

DP 28. Longest 0:09:38

DP 28. Longest Palindromic Subsequence

Lecture 136: Longest 0:08:25

Lecture 136: Longest Palindromic Subsequence || DP on Strings

Longest palindrome substring 0:20:57

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

Longest Palindromic Subsequence 0:18:04

Longest Palindromic Subsequence - Leetcode 516 - Python

L13 : Longest 0:17:05

L13 : Longest Palindromic Substring | Dynamic Programming Part 1 | CodeNCode

Longest Palindromic Substring 0:08:26

Longest Palindromic Substring | Dynamic Programming | Explanation with Code

Longest Palindromic Substring 0:26:32

Longest Palindromic Substring - Dynamic Programming - Interview Preparation

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

sir your patience of explaining problem is outstanding

notinrange
Автор

Well taught Sir...
As always, completely satisfied with the explanation !
Thank you so much !
May God bless you Sir !

vishwashdwivedi
Автор

There is one more way to do it if you store length of longest palindrome sub string
at each spot starting from gap 0 diagonal initializing with 1 and eventually if you get equal extremities you fill the spot by 2 + dp[i+1][j-1] otherwise dp[i+1][j-1] and the final answer you will get at dp[0][n-1].

Btw this is also a nice method and great explanation as well.

projectdemoandpresentation
Автор

Waiting for the manacher's algorithm video, didn't find any good video. And I think you can explain it better than anyone else, on youtube :)

hemantagarwal
Автор

perfect and accurate solution in all other solutions

codeman
Автор

Thank you for a wonderful explanation sir!

Lucifer-jlvh
Автор

Amazing explanation !! Thank you very much :)

mrprime
Автор

bhai sahab kyaa padhaya h yrr, Thats my 4th video for this question Samjh hun aaya jaake, Att krtii

ersarthaksethi
Автор

Linear time solution possible using Manacher's algo. for the same

sayantaniguha
Автор

Thank you sir. Need one suggestion to solve this issue. "Find largest palindrome from [input: str = abaghcmadam, output: madam]

SubrataMandalmandal
Автор

Sir there is a variation in which we return the string instead of length. What's the code changes for that?

kshitijjain
Автор

sir ham same matrix se susbtring aur subsequence dono produce kr rhe hai, thoda confusion ho jata hai

mickyman
Автор

can someone please run the code for bbbab. i am getting 3 but ans will be 4

informative
Автор

Sir, kya aap please top down(recursion wali) approach upload kr skte hain? Usmei easy rehta hai samajhne mei.

nimishgupta
Автор

please number the videos sir..you mention last video but which one is last ?

fahadabdullah
Автор

Sir, I have run this on leetcode it is showing 1544ms run time, faster then only 5%, but your explanation is on another level🥰

codebits
Автор

how to print the Longest Palindromic Substring please explain

harshagarwal
Автор

SIR I REALLY WISH THAT YOU MAKE DP PLAYLIST USING TOP DOWN METHOD...LIKE ADITYA VERMA...I REALLY REALLY WISH THAT....PLEASE DO SIR....DO TEEN DIN LGENGE BAS AAPKO

fahadabdullah
Автор

Very nice sir ..!!
Sir please make a video on
"WORD WRAP" problem.
No one is able to explain it clearly on YouTube

HarivanshKripaVlogs
Автор

Sir, I have run this on leetcode it is showing 1544ms run time, faster then only 5%

codebits
join shbcf.ru