Arpit Bhayani

Explore conflict resolution strategies in multi-master databases.

Understand conflicts in multi-master databases - Learn how to detect and resolve data inconsistencies for reliable systems.

Explore Multi-Master replication - its benefits like load sharing and high availability, use cases, and key challenges to consider.

Explore how asynchronous database replication creates "wormholes" in data consistency and how to fix it with monotonic reads.

Explore read-your-writes consistency in distributed systems.

Explore Master-Replica architecture - handling node outages, replica recovery, and master failover strategies for robust systems.

Explore Master-Replica replication - Understand statement-based vs. row-based formats, advantages, and disadvantages for distributed systems.

Explore synchronous, asynchronous, and semi-synchronous data replication strategies in distributed systems.

Explore the Master-Replica architecture - how it scales reads, handles writes, and recovers from failures.

Explore database durability, the "D" in ACID.

Dive into database isolation!

Understand database consistency (the "C" in ACID) and its importance.

Understand Atomicity (the "A" in ACID) in databases, file systems, and hardware.

Explore common architectures in distributed systems, including client-server, 3-tier, n-tier, and peer-to-peer.

Learn about the 8 common fallacies of distributed computing that can lead to critical system design flaws.

Online Coding Platforms and Code Evaluators are susceptible to this attack as they accept raw code from the user and execute it.

Explore Python's chained comparisons (like a < b < c) and short-circuiting.

Model Udemy's taxonomy on a relational database.

Explore Python's walrus operator ( -=) and its quirks!

Explore Fully Persistent Arrays - Understand how to implement arrays that preserve all previous versions, enabling auditing and historical access.

Explore persistent data structures - access historical versions, understand partial, full, and confluent persistence, and see real-world applications.

Explore Python's constant folding - how it optimizes code by evaluating expressions at compile time.

Explore Python's string interning - a compiler optimization for performance.

Visualize recursion in Python!

Approximate count-distinct in streams using the Flajolet-Martin algorithm.

Explore the 2Q cache eviction algorithm, an improvement over LRU, used in databases like Postgres.

Explore Israeli Queues, a unique priority queue variation where elements join friends already waiting!

Explore procedural 1D terrain generation for games using Python.

Learn Jaccard Similarity and MinHash, a technique to efficiently estimate set similarity at scale for tasks like near-duplicate detection.

Learn how to optimally smooth time series data using kurtosis to highlight anomalies.

Explore constant time LFU cache implementation using hash tables and doubly-linked lists.

Learn about the Morris Algorithm, a probabilistic method for counting large events with minimal memory.

Explore Slowsort, the deterministically worst sorting algorithm!

Bitcask was introduced as the backend for a distributed database named Riak in which each node used to run one instance of Bitcask to hold the data that it was responsible for.

Explore Phi Accrual Failure Detection, an adaptive algorithm for detecting failures in distributed systems.

Crack repeating-key XOR ciphers!

Crack single-byte XOR ciphers!

Dive into Python internals - Modify CPython to make integers iterable!

Emulate inheritance in C using structure composition!

Explore the RUM Conjecture - How Read, Update, and Memory overheads impact storage system design and performance trade-offs.

Consistent hashing is a hashing technique that performs really well when operated in a dynamic environment where the distributed system scales up and scales down frequently.

Dive into Python's integer implementation!

Explore Binary Search variations k-searches, unified search & fractional cascading.

Explore Copy-on-Write (CoW) - Boost performance, manage resources, and enable versioning.

Explore MySQL InnoDB's buffer pool and its midpoint insertion strategy for efficient cache management and scan resistance.

Explore Finite State Machines (FSM) with Python coroutines.

Learn how to create a robust rating system using Bayesian Average to rank items effectively.

A rate limiter restricts the intended or unintended excessive usage of a system by regulating the number of requests made to/from it by discarding the surplus ones.

Explore Inverse Document Frequency (IDF), a key concept in search & text mining.

8 rituals to level up your programming skills!