This site uses JavaScript for navigation, themes, and games like 2048. Please enable JavaScript in your browser settings, then reload the page.
4 problems. Click one to open the details.
0/4 solved
1.Minimum Bracket Reversals
Min reversals to balance an even-length bracket string.
2.Rabin-Karp Pattern Matching
Rolling hash search for pattern in text.
3.Z-Function
Z-array: longest substring from i matching prefix.
4.KMP / LPS Array
Build LPS; search pattern in O(n+m).