Search for a given string pattern inside a large file (e.g., 500MB) when available memory is strictly constrained (e.g., 100MB), using algorithms like KMP or rolling hash.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.