Longest Palindromic Subtring | Dynamic Programming

[ganesh-utla]

Problem Statement: Given a string s, return the longest palindromic substring in s. A string is called a palindrome string if the reverse of that string is the same as the original string. Substring is a part of the string that can be achieved by deleting zero or more characters from the beginning and from the ending of the string.

Input: "Any String" Output: "palindromic substring with maximum length"

Eg: Input: "abcbabcbade"
Output: "abcbabcba"

[ganesh-utla]

Please assign me to this task..

[deepalithakur17]

I can do it sir , please assign this task to me.

[abhijeet-crypto]

i want to work on this please assign it to me.

[ratansen]

I want to work on this sir, please assign it to me.

[Sounakray2003]

I would like to contribute

[RohitSingh107]

Please assign this to me, I will do not only time complexity optimized but also space optimized dp solution as well.

[SusavanMondal]

Hello, I am interested to solve this issue. Please assign it to me

[Prudhvi26102000]

Hello, I am ready with this solution and interested to solve this issue. Can you assign this to me?

[sushmita-2002]

Can You assign this issue to me. I will try my best to give you the desired code.