Skip to content

This repository implements a Dynamic Programming algorithm in C++ to find the Longest Palindromic Subsequence (LPS) in a given string.

Notifications You must be signed in to change notification settings

t2d04/Longest-Palindromic-Subsequence

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 
 
 
 
 
 
 

About

This repository implements a Dynamic Programming algorithm in C++ to find the Longest Palindromic Subsequence (LPS) in a given string.

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages