Skip to content

String Algorithms Overview

This section contains documentation for string processing algorithms.

Available Algorithms

  • Autocomplete: Text completion using various data structures and strategies including Trie, Suffix Tree and Suffix Array approaches
  • Edit Distance: Computing minimum edit distance between strings using dynamic programming
  • Longest Repeated Substring (LRS): Finding the longest substring that appears multiple times in a text using various strategies
  • Longest Common Substring (LCS): Finding the longest substring shared between two strings using Suffix Tree, Suffix Array and hybrid approaches
  • Palindrome Detection: Multiple approaches for detecting palindromes including two-pointer, recursive and dynamic programming methods

Each algorithm includes multiple implementation strategies optimized for different use cases, with detailed performance characteristics and practical applications.