As software engineers, we thrive to deliver software that produces correct results while being fast and using as little resources as it can. Mostly, there is a trade-off between the running time of the program and the memory it consumes, but that's not always true.

Sliding window algorithm on steroids! This modifies the existing sliding window algorithm for a particular use-case to provide better results without complex deep-learning algorithms.

Code snippet to check if the browser is running in private (incognito) mode.

Learn how autoencoders can be used to create a content-based image retrieval (CBIR) system that allow us to find visually similar images for a given input image.

Learn how to quickly perform color transfer from one input image (source) onto another input image (destination) by utilizing the Lab* color space and the mean and standard deviation of each L*, a*, and b* channels.

This is my attempt at replicating how the Counter-Strike: Global Offensive MatchMaking works in queueing players at similar ranks in a reasonable amount of time.

Initially written down to revise C++ since I became very rusty for not using it much lately. Thought of sharing it with the world!

CS:GO has always been an interesting game. Released in 2012, and still no one knows the optimal strategy to play this game, because there isn't. Everyday we learn something new about this game which keeps us engaged. Let's look at this game from a different perspective.

Learn how you can perform an in-place "uniform" shuffle of a list such that each element in the original list has the same probability of ending up in each spot in the final list.

Fibonacci numbers are the numbers in the following integer sequence, called the Fibonacci sequence, and characterized by the fact that every number after the first two is the sum of the two preceding ones. But there's an unintuitive way to calculate them and it's very fast!