Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Can we have Lyndon Factorization #209

Open
SPyofgame200 opened this issue Dec 29, 2021 · 0 comments
Open

Can we have Lyndon Factorization #209

SPyofgame200 opened this issue Dec 29, 2021 · 0 comments

Comments

@SPyofgame200
Copy link

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
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@SPyofgame200