Hoang Anh Vo

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

I face up with a problem (https://codeforces.com/blog/entry/93981) that use your paper (https://arxiv.org/pdf/1206.3369.pdf) and in theory I have proved it can be solved very fast (https://math.stackexchange.com/questions/4230187/faster-algorithm-for-counting-non-negative-tripplea-b-c-satisfied-a-b-c) but I failed to achieved...

### Is this a hackmd.io issue? - [X ] Yes, the bug happens on https://hackmd.io - [ ] No. If it's a self-hosted CodiMD instance, please fire up the issue...

Is is possible to do something like this ``` ](solution.png) ``` As there is a case where I have a plugin that automatically...

Slide didn't work with hackmd import

1

when I create another hackmd page for a portion of the slide  It is either completely black (when I don't do anything after import)  displayed the wrong slide...

Feature Proposal: Add a Flag to Toggle Rendering Behavior (RenderInCurrentWindow = false by default)

1

## Summary Introduce a configurable flag, `RenderInCurrentWindow`, to control whether the test engine renders within the existing UI instead of creating a separate floating window. By default, this flag will...