I came across a problem on leetcode a few days ago. It asked me to implement a simple regex (regular expression) matcher which supports both . and * qualifiers. A brute force algorithm for this simple case alone could end up an exponential time efficiency, not to mention if it were to support all basic regex operators, i.e. Continue reading...
Prove Logs on Blockchain with Go and ProvenDB
It’s been a long time since my last blog post. Here is my recent one on Medium: ProvenLogs is a simple yet performant logging service built…