Leetcode Problem Solving #5 - Longest Palindromic Substring | Dynamic Programming | Tamil

Disclaimer: Everything I say in this video is my own opinion and not that of my employer or any other organization.

My free Programming courses:

Other Topics Explained:

Laptop & Hardware Recommendations to Buy:
Laptops:

External Keyboard:

External Mouse:

Wireless Mouse:

Wireless Keyboard & Mouse

(Some links above are affiliate links. I may get some commission if you buy through the link. No additional charges for you)

#CsInTamil #programming #tamil

[sanjairs]

Bro Thank you for your Hardworking 💙🙏🏻. Keep uploading bro

[MuthuAnushya]

I think python la default ah value store panna ventam nenaikken so O(n2) time kuraum

[mdumar]

Kindly solve more dynamic programming questions!

[shiva]

Bro dynamic programming paththi thaniya video podunga bro

[yuvaraj]

Bro please python la solve pannunga my kind request.

[rajrajesh]

Nalla explain paneenga boss. There doesn't seem to be any other video even in English that explains this properly.

Also tracking longest is not required for the problem to be solved. Right?

[Vijay--]

bro indha program test case wrongnu vandhutu bro🤐

[maverick]

Python Solution:

#i did using two pointer approach but I'm also getting time limit exceeded


class Solution(object):
def longestPalindrome(self, s):
"""
:type s: str
:rtype: str
"""
def check_palindrome(string):
n = len(string)
for i in range(n//2):
if string[i] != string[n-i-1]:
return False
return True

ans = []
i = 0
j = len(s)

while(i<len(s)):
if(i!=j):

ans.append(s[i:j])
j-=1
else:
j-=1

if(i==j):
i+=1
j = len(s)
ans_length = []
for i in ans:
ans_length.append(len(i))
return