Monthly Archives: March 2019

Let’s talk about Fenwick trees(a.k.a. Binary Indexed Trees) for a moment and see how we can use them to solve range problems. This is not a tutorial, just a few notes for my future self. By the way, I already … Continue reading →

Today I solved two problems on LeetCode that involved intervals(i.e., pairs of values of the form [start, end]) and I thought it would be a good idea to share a basic strategy that I know of for tackling these kinds … Continue reading →

So, I was asked to implement an LRU cache a few years ago in an interview with Oracle, which I couldn’t quite solve on my own in O(1). Recently I found this problem on LeetCode and I can say this … Continue reading →