filmov
tv
Longest Palindromic Substring using dynamic programming : step by step with intuition
Показать описание
Before watching this video do keep one thing in mind, never confuse longest common substring with longest common subsequence.
Both are different. Well the basic difference lies in the meaning of both.
1. Substring is a sequence of characters which are contiguous
2. Subsequence is also a sequence of characters which may be or may not be contiguous.
This means that a subsequence can be a substring but a substring can't be a subsequence.
In this video, I am going to teach you to solve longest palindromic substring using dynamic programming.
So, I did a video in which I told you about how to develop an intuition(link below) to come up with the solution of longest palindromic subsequence.
Well, the work on developing the intuition when it comes to longest palindromic substring is more or less the same but the difference lies in the approach.
Your approach can automatically be changed when you're going to give enough emphasis on the word substring.
Another thing which can greatly help you is go by the method using which we solved longest palindromic subsequence (link below) and apply the same in solving
the longest palindromic substring, you will come to know what I am talking about. Use this string 'dabcba'
After you have done the task and I am sure you're going to figure out where you're going wrong with the older method then only thing you have to do
is while constructing the dynamic programming algorithm at each subproblem you have to ask 'Is this a palindrome?'
If a subproblem is a palindrome then you're going to mention true there but if it is not then you have to mention it as false. Complete the matrix and then
it will tell you how to find out the length of the longest palindromic substring.
connection between different dynamic programming problems is the key to develop the intuition to solve DP problems.
So, with all the information with you let's watch this exciting video of Joey's dynamic programming tutorial series.
Both are different. Well the basic difference lies in the meaning of both.
1. Substring is a sequence of characters which are contiguous
2. Subsequence is also a sequence of characters which may be or may not be contiguous.
This means that a subsequence can be a substring but a substring can't be a subsequence.
In this video, I am going to teach you to solve longest palindromic substring using dynamic programming.
So, I did a video in which I told you about how to develop an intuition(link below) to come up with the solution of longest palindromic subsequence.
Well, the work on developing the intuition when it comes to longest palindromic substring is more or less the same but the difference lies in the approach.
Your approach can automatically be changed when you're going to give enough emphasis on the word substring.
Another thing which can greatly help you is go by the method using which we solved longest palindromic subsequence (link below) and apply the same in solving
the longest palindromic substring, you will come to know what I am talking about. Use this string 'dabcba'
After you have done the task and I am sure you're going to figure out where you're going wrong with the older method then only thing you have to do
is while constructing the dynamic programming algorithm at each subproblem you have to ask 'Is this a palindrome?'
If a subproblem is a palindrome then you're going to mention true there but if it is not then you have to mention it as false. Complete the matrix and then
it will tell you how to find out the length of the longest palindromic substring.
connection between different dynamic programming problems is the key to develop the intuition to solve DP problems.
So, with all the information with you let's watch this exciting video of Joey's dynamic programming tutorial series.
0:15:21
Longest palindromic substring | Dynamic programming
0:08:11
Longest Palindromic Substring - Python - Leetcode 5
0:01:00
palindromes were tricky until I learned this
0:10:01
Longest Palindromic Sub-string (LeetCode 5) | Full solution with examples | Study Algorithms
0:14:40
LeetCode 5. Longest Palindromic Substring (Algorithm Explained)
0:16:46
Longest Palindromic Substring Manacher's Algorithm
0:11:45
Longest Palindromic Substring Dynamic Programming | Explanation with Code
0:04:33
Longest Palindromic Subsequence | Dynamic Programming | Set 12 | GeeksforGeeks
0:16:27
Longest Palindromic Substring using dynamic programming : step by step with intuition
0:25:19
Leetcode problem Longest Palindromic Substring (two solutions)
0:08:52
E004 : Longest Palindromic Substring | Dynamic Programming | CodeNCode
0:23:52
Leetcode 5. Longest Palindromic Substring
0:21:14
5. Longest Palindromic Substring | Day 001 | Brute - Better - Optimal | 2 Pointers | DP
0:16:07
LeetCode 5. Longest Palindromic Substring， Dynamic Programming Python
0:20:57
Longest palindrome substring - LeetCode Interview Coding Challenge [Java Brains]
0:37:58
DP-10: Longest Palindromic Substring
0:09:18
Longest Palindromic Subsequence
0:18:08
Longest Palindromic Substring - LeetCode #5 | Dynamic Programming - Python
0:16:43
Longest Palindromic Substring: 5 - String interview Question @ amazon, google, meta, microsoft,tesla
0:08:33
Longest Palindromic Substring - LeetCode 5 - Blind 75 - Coding Interview
0:09:38
DP 28. Longest Palindromic Subsequence
0:00:59
Longest palindrome in a given string using dynamic programming
0:00:59
Sliding Window Algorithm Explained Clearly | Longest Substring Without Repeating Characters Leetcode
0:16:25
Longest Palindromic Substring | LeetCode 5 | C++, Java, Python
Комментарии