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

[@prakashbtw678]

Thanks for your consistency bro.

[@sanjairs6934]

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

[@arunachalams2024]

Keep going bro 🔥👌🏼

[@caravindpandi]

Thanks a lot. Keep uploading,..

[@codewithdeku]

Keep Going Bro❤‍🔥

[@MuthuAnushya]

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

[@mdumar1525]

Kindly solve more dynamic programming questions!

[@TecRox-]

Use manacher's algorithm

[@vidh1807]

Thanks for the good explanation..

[@yuvaraj6608]

Bro please python la solve pannunga my kind request.

[@shiva0535]

Bro dynamic programming paththi thaniya video podunga bro

[@shanmugavel007]

BRO WEEKLY one's QNA PODUNGA

[@அட்]

Definitely need this😍

[@divyams29]

java solution bro

[@vinayakram5133]

🙏🙏🙏

[@Vijay-123-46]

bro indha program test case wrongnu vandhutu bro🤐

[@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?

[@vmbalamurugan2861]

Code in java

[@maverick6932]

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