There are 2 repositories under subsequence topic.
A Swift library for writing & manipulating patterns for matching on collections.
//contains recursion programs for practice and learning
The longest common subsequence (LCS) problem is the problem of finding the longest subsequence common to all sequences in a set of sequences (often just two sequences). It differs from problems of finding common substrings: unlike substrings, subsequences are not required to occupy consecutive positions within the original sequences. The longest common subsequence problem is a classic computer science problem, and has applications in bioinformatics.
Easily generate subsequences from a provided map, array, or string input.
Dynamic Programming
"Number of Matching Subsequences" LeetCode Problem Solution
Return a shallow copy of a portion of an array.
Assign element values from a broadcasted input array to corresponding elements in an output array.
Convert an array to an object supporting fancy indexing.
Create an iterator which returns a subsequence of iterated values from a provided iterator.
Create a MultiSlice object from a list of MultiSlice constructor arguments.
Compute the number of elements in a normalized slice.
Return a list of non-reduced dimensions in an un-normalized multi-slice.
Normalize a MultiSlice object.
Normalize a Slice object.
Return a list of reduced dimensions in an un-normalized multi-slice.
Create a MultiSlice object from a comma-separated list of string-serialized MultiSlice constructor arguments.
Convert a multidimensional subsequence string to a MultiSlice object.
Convert a subsequence string to a Slice object.
Compute the shape of a normalized multi-slice.
Convert a Slice object to a subsequence string.
Parse a string-serialized MultiSlice object.
Parse a string-serialized Slice object.
Convert a subsequence string to a Slice object.
PHP implementation of an algorithm to solve the `longest common subsequence` problem.
Minimal elements for the base b representations of the prime numbers > b for the subsequence ordering, for 2 ≤ b ≤ 36
A program that finds substrings within a list of several strings
Here are the medium level recursion question
Around 30 Recursion Questions are Uploaded
Dynamic programming algorithms