A time and space optimal suffix and LCP arrays construction for constant alphabets is proposed.
The algorithm can be viewed as an adaptation of (Fischer, WADS'11) to (Nong, 2013).
The algorithm runs in linear time using constant workspace.
Performance of our algorithm is competitive in practice.
The source code is publicly available at github.