Skip to content

1robertslattery/Longest_Common_Subsequence

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Longest Common Subsequence

Given two sequences, find the maximal length of longest subsequence present in both of them. A subsequence is a sequence that appears in the same relative order, but not necessarily contiguous.

About

Finding the longest common subsequence using dynamic programming.

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages