Advanced and Approximate Algorithms

- Mar 07, 2022 : Genetic algorithm to solve the Knapsack Problem
- Feb 21, 2022 : Pseudorandom number generator uusing LFSR
- Feb 15, 2021 : Fully Persistent Arrays - a datastructure that let's us time travel
- Feb 07, 2021 : Introduction to Persistent Data Structures
- Dec 06, 2020 : Flajolet Martin algorithm for approximate counting
- Nov 08, 2020 : Quantifying set similarity using Jaccard similarity coefficient and MinHash
- Nov 01, 2020 : Smooth out time-series data using Kurtosis
- Aug 02, 2020 : Morris's algorithm for approximate counting
- Jul 26, 2020 : Slowsort - the slowest sorting algorithm, ever
- Jul 12, 2020 : Phi φ Accrual - a realistic failure detection algorithm
- May 10, 2020 : Fractional Cascading - a way to speed up binary searches
- Mar 10, 2020 : The math behind Inverse Document Frequency - the IDF of TFIDF
- Feb 14, 2020 : Pseudorandom Number Generation using Cellular Automata - Rule 30
- Jan 31, 2020 : Isolation Forest Algorithm for Anomaly Detection

Prototypes

- Jun 09, 2021 : Fork Bomb
- Dec 13, 2020 : Building a simple recursion tree visualizer for Python
- Jun 07, 2020 : Stucture composition in C - implementing inheritence in C
- Apr 19, 2020 : Building Finite State Machines with Python Coroutines
- Apr 12, 2020 : Bayesian average to compute average rating, properly
- Feb 21, 2020 : Personalize your Python Prompt
- Feb 07, 2020 : Implementing functional overloading in Python

Cryptography

- Jul 05, 2020 : Deciphering Repeated-key XOR Ciphertext
- Jun 21, 2020 : Deciphering Single-byte XOR Ciphertext
- Jan 17, 2020 : Image Steganography - the art of hiding data in images

Arpit's Newsletter read by 100,000 engineers

Weekly essays on real-world system design, distributed systems, or a deep dive into some super-clever algorithm.

- © Arpit Bhayani, 2024