Problem Statement Given n non-negative integers representing the histogram’s bar height where the width of each bar is 1, find the area of largest rectangle in the histogram. Above is a histogram where width of each bar is 1, given height = [2,1,5,6,2,3]. The largest rectangle is shown in the shaded area, which has area 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…