Add greedy method for longest palindromic subsequence#3958
Add greedy method for longest palindromic subsequence#3958gideonshaked wants to merge 3 commits intoTheAlgorithms:masterfrom gideonshaked:greedy-lps
Conversation
Pull Request Report@The-Kid-Gid Hello! I'm a bot made to check all the pull request Python files. First of all, I want to say thank you for your time and interest in this project and for opening a pull request. I have detected errors in some of the Python files submitted in this pull request. Please read through the report and make the necessary changes. You can take a look at the relevant links provided after the report. What are node paths? 🔽
Following class/functions/parameters require descriptive names:
Relevant links 🔽 |
|
@dhruvmanila check this |
| to occupy consecutive positions. | ||
|
|
||
| Explanation: | ||
| https://www.techiedelight.com/longest-palindromic-subsequence-using-dynamic-programming/ |
There was a problem hiding this comment.
This code is a direct copy from the mentioned link.
@cclauss Please take a look at this.
There was a problem hiding this comment.
true, only a few names are changed which was recommended by bot
|
Closing. This is code copied from elsewhere and we are already planning to remove the greedy_method directory because it does not fit in with our other root directories. #3956 |
|
@cclauss @dhruvmanila @xcodz-dot thanks. I followed the explanation of the algorithm from the article and my code turned out very similar. I didn't mean to waste the time of the maintainers, and I understand your decision. |


Describe your change:
Add a recursive backtracking programming solution to the longest palindromic subsequence problem.
Checklist:
Fixes: #{$ISSUE_NO}.