算法沙龙
- find the longest repeated substring. [SOL] suffix array and LCP, O(n).
- check if a linked list is palindrome. [SOL] two pointer, O(n).
- longest common substring, longest common subsequence. [SOL] dynamic programming, O(n^2).
- Integer2roman and Roman2Integer. [Easy].