When I was a junior engineer I was given small bugs to fix and small features to work on. However the way we develop larger features is different from the way smaller bugs are fixed or features are developed. I Read more
The Least Recently Used (LRU) cache is a cache eviction algorithm that organizes elements in order of use. In LRU, as the name suggests, the element that hasn’t been used for the longest time will be evicted from the cache.
I recently started using Emacs for text editing purposes and was pleasantly surprised. My main goal to learn it was to work efficiently in teams that don’t have a nice local dev environment and you need to have a dev Read more
AdBlock for blocking ads. also adblock plus Go Fucking Work is what I use to block sites like Reddit or Facebook so that I don’t get distracted. Grammarly is a grammar-checking extension for you to improve any writing. (It’s also available for Firefox Read more
It is very important to identify everyone’s priorities in a software engineering organization. In a sense, priorities are about people and what facts are about things. Because of this, it can be easy to overlook priorities, since they are more Read more
C++ hasn’t yet caught up with implementing 2D arrays like other languages yet. So there is no inbuilt 2D array in C++.But lose no hope, with some template programming to the rescue we can create our own multidimensional data structure. Read more
Below is an implementation of thread-safe queue using synchronization primitives.
A C++ string class can be implemented in more than one way. I used char*(or rather T*) as a base for implementation. The reason for templatization was to mimic the way standard library does things. It supports all the construction, Read more
There are 2 ways in C++ to get the size of an array. The first is using run-time computation with sizeof, but there is a better compile-time way to compute the size. The way to do it as follows: Note: Read more
Topological Sort is used to find a linear ordering of elements that have dependencies on each other. For example, if event ‘B’ is dependent on event ‘A’, ‘A’ comes before ‘B’ in topological ordering. Lets say we are asked to find Read more