Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Longest Palindromic Substring #267

Closed
amiteshag320 opened this issue Oct 4, 2021 · 1 comment
Closed

Longest Palindromic Substring #267

amiteshag320 opened this issue Oct 4, 2021 · 1 comment
Assignees

Comments

@amiteshag320
Copy link
Contributor

I will write a code to solve a dynamic programming problem named Longest Palindromic Substring , with proper comments , TC , SC and example.
Please Assign this issue to me .
Thanks !!

harsh6975 added a commit to harsh6975/Hacktoberfest2021 that referenced this issue Oct 4, 2021
Sniper7sumit#267 Solved and Explained intuition behind the solution.
@harsh6975
Copy link
Contributor

The longest Palindromic Substring can be solved without using dynamic problem. So we can even optimize space complexity.
I will explain the intuition behind it, time complexity with proper comments.
Please assign me
Thanks

harsh6975 added a commit to harsh6975/Hacktoberfest2021 that referenced this issue Oct 4, 2021
Explained and solved intuition behind the solution
harsh6975 added a commit to harsh6975/Hacktoberfest2021 that referenced this issue Oct 4, 2021
Explained and solved intuition behind the solution
Sniper7sumit added a commit that referenced this issue Oct 4, 2021
#267 Solved Longest Palindromic Substring
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants