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.
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.
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!
The use of random permutations is often fundamental to fields that use randomized algorithms such as coding theory, cryptography, and simulation. A good example of a random permutation is the shuffling of a deck of cards: this is ideally a random permutation of the 52 cards.