libsais is a library for linear time suffix array, longest common prefix array and burrows wheeler transform construction based on induced sorting algorithm.

The esa-matchfinder is a C99 library for efficient Lempel-Ziv factorization using enhanced suffix array (ESA).

Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string "". Example 1: Input: strs = ["flower","flow","flight"] Output: "fl" Example 2: Input: strs = ["dog","racecar","car"] Output: "" Explanation: There is no common prefix among the input strings.

A longest common prefix library implementation for Go

Prolog Projects

DNA palindrome may have significant role in DNA replication that are found frequently in human cancer cells. Data Structures - Suffix Array, Longest Common prefix Array.

Typescript implementation of trie/digital tree/radix tree/prefix tree/suffix tree.

Leetcode.com Longest Common Prefix Solution [8ms, 19MB memory usage (less than 80%) ]

Python C module for creating suffix, LCP and BWT arrays with UTF-8 text.

Learned as a part of Algorithm Design Course

A few programs that I've worked on

This code shows us how to find the longest common prefix of an array of multiple strings!