This repo consists codes of Aditya Verma - Dynamic Programming Playlist

Distance related functions (Damerau-Levenshtein, Jaro-Winkler , longest common substring & subsequence) implemented as SQLite run-time loadable extension. Any UTF-8 strings are supported.

[VLDB 2022] Dash application for "Navigating the Labyrinth of Time Series Anomaly Detection"

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…

Convert an array to an object supporting fancy indexing.

The minimal elements of the prime numbers which are > b written in the positional numeral system with radix b, as digit strings under the subsequence ordering, for 2 ≤ b ≤ 36

"Number of Matching Subsequences" LeetCode Problem Solution

Create a MultiSlice object from a comma-separated list of string-serialized MultiSlice constructor arguments.

Parse a string-serialized Slice object.

Return a list of non-reduced dimensions in an un-normalized multi-slice.

Convert a multidimensional subsequence string to a MultiSlice object.

PHP implementation of an algorithm to solve the `longest common subsequence` problem.

Easily generate subsequences from a provided map, array, or string input.

Parse a string-serialized MultiSlice object.

This repository contains a variety of well-crafted code examples that are ideal for practice. Enjoy!!

Convert a subsequence string to a Slice object.