subsequence

boniolp/Theseus

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

yashk9293/Aditya-Verma-Dynamic-Programming

This repo consists codes of Aditya Verma - Dynamic Programming Playlist

ctxppc/PatternKit

A Swift library for writing & manipulating patterns for matching on collections.

anshumagahlot22/Recursion-Programs

//contains recursion programs for practice and learning

greed2411/LCS

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.

stdlib-js/array-to-fancy

Convert an array to an object supporting fancy indexing.

xayahrainie4793/minimal-elements-of-the-prime-numbers

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

CodeRex7/CodingPractice

eMahtab/maximum-sum-increasing-subsequence

Given an array, find the maximum possible sum for Increasing Subsequence

forcir/subsequences

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

HarshSahuH/Aditya-Verma-DP

Dynamic Programming

LoneExpert/Algorithm-s-and-Code

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

Mohamedhany99/Number-of-Matching-Subsequences-LeetCode-Problem

"Number of Matching Subsequences" LeetCode Problem Solution

Nisu692/The-X-Factors

A Energy, Power and Cost Optimization Solution powered by AI, Created by the Team X- Factors

pyusha1006/leetcode

stdlib-js/array-base-fancy-slice

Return a shallow copy of a portion of an array.

stdlib-js/array-base-fancy-slice-assign

Assign element values from a broadcasted input array to corresponding elements in an output array.

stdlib-js/iter-fill

Create an iterator which replaces all values from a provided iterator from a start index to an end index with a static value.

stdlib-js/iter-slice

Create an iterator which returns a subsequence of iterated values from a provided iterator.

stdlib-js/ndarray-to-fancy

Convert an ndarray to an object supporting fancy indexing.

stdlib-js/slice-base-args2multislice

Create a MultiSlice object from a list of MultiSlice constructor arguments.

stdlib-js/slice-base-length

Compute the number of elements in a normalized slice.

stdlib-js/slice-base-nonreduced-dimensions

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

stdlib-js/slice-base-normalize-multi-slice

Normalize a MultiSlice object.

stdlib-js/slice-base-normalize-slice

Normalize a Slice object.

stdlib-js/slice-base-reduced-dimensions

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

stdlib-js/slice-base-sargs2multislice

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

stdlib-js/slice-base-seq2multislice

Convert a multidimensional subsequence string to a MultiSlice object.

stdlib-js/slice-base-seq2slice

Convert a subsequence string to a Slice object.

stdlib-js/slice-base-shape

Compute the shape of a normalized multi-slice.

stdlib-js/slice-base-slice2seq

Convert a Slice object to a subsequence string.

stdlib-js/slice-base-str2multislice

Parse a string-serialized MultiSlice object.

stdlib-js/slice-base-str2slice

Parse a string-serialized Slice object.

stdlib-js/slice-seq2slice

Convert a subsequence string to a Slice object.

Triun/PHP-Longest-Common-Subsequence

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