kactl
kactl copied to clipboard
Can we have Lyndon Factorization
For simple, short, linear implementation for Smallest Lexicalgraphical String Rotation which usually be solved in O(n log n) using Hash/Suffix Array/Suffix Tree/Suffix Automaton/DC3 Algo