CPKit
v1.6.1

String Laboratory (ST)

Compute character frequencies, test anagrams, run KMP/Z matching passes, compare edit distance tables, and build suffix array indices.

All String Utilities (15)

Basic

Character Frequency Counter

Analyze total, unique, and duplicate character counts inside a given text string.

EasyO(N log U)Open Tool
Basic

Palindrome Checker

Verify if a word, phrase, or sentence is palindromic, supporting case and spacing configurations.

EasyO(N)Open Tool
Basic

Reverse String

Invert character order, word sequences, or line structures within a multiline text bloc.

EasyO(N)Open Tool
Basic

String Rotation

Shift characters cyclically to the left or right, and validate if two strings are cyclic rotations of each other.

EasyO(N)Open Tool
Basic

Anagram Checker

Verify if two strings are anagrams of each other and compare character frequency distribution side-by-side.

EasyO(N + M)Open Tool
Searching

Substring Search

Locate character patterns inside text blocks using naive linear alignment scans.

EasyO(N * M)Open Tool
Algorithms

Prefix Function (KMP)

Compute the proper prefix-suffix matching table (pi array) and visualize index skips.

MediumO(N)Open Tool
Algorithms

Z Function

Compute longest common prefix matching lengths for all suffixes (Z-array) in linear time.

MediumO(N)Open Tool
Hashing

Rolling Hash

Compute polynomial rolling checksum hashes of strings and audit for mathematical collisions.

MediumO(N)Open Tool
Dynamic Programming

Edit Distance (Levenshtein)

Calculate the minimum character operations to transform string A to string B, drawing the complete DP table.

MediumO(N * M)Open Tool
Algorithms

Longest Common Prefix

Find the longest shared prefix string among a set of multiple words.

EasyO(S)Open Tool
Dynamic Programming

Longest Common Subsequence

Compute the longest common subsequence of two strings and trace the DP backtracking path.

MediumO(N * M)Open Tool
Algorithms

Longest Palindromic Substring

Extract the longest palindromic substring, highlighting it inside the text sequence.

MediumO(N^2)Open Tool
Suffixes

Suffix Array

Generate lexicographically sorted suffix tables for a text string and build suffix arrays.

HardO(N^2 log N)Open Tool
Suffixes

Aho-Corasick TrieSoon

Multi-pattern string search trie automaton matcher.

HardO(N + M + K)Open Tool