Engineering

Tail Amplification

Tail amplification is a statistical phenomenon observed in process or operation fanout in software and other systems. A single request that fans out to multiple requests to downstream services amplifies the probability of sampling a tail probability that is disproportionate to the sampling rate.

Read more →


Featured Coding Puzzles

Equal Partition of an Array of Numbers (Medium)

Given an array of integers, write a function to determine if the array can be split into 2 subsets with equal sums. This is similar to Balanced Split of an Array of Numbers, but, in this case, the partitioning can include elements from all over the array instead of either before or after a specific index in the array.

View Puzzle →


Cafeteria Seating (Medium)

A cafeteria table consists of $n$ seats, numbered 1 to $n$. There must be $k$ empty seats to the left and right of everyone sitting at the table, unless they are sitting at the left or the right end of the table, in which case they don't need $k$ empty seats on the left or right, respectively. If you are given an array $s$ of seating positions for the people currently sitting on the bench, find the number of additional people who can still sit at the table.

View Puzzle →

See all coding puzzles →


Featured Algorithm Patterns

Queue

A queue is a first-in first-out (FIFO) data structure that is used for various DSA (data structures & algorithms) problems.

View Pattern →


Quick Select

Quick select is an adaptation of the quicksort algorithm to find the top or bottom $k$ elements in a collection. The algorithm entails doing a quicksort until we randomly find a pivot that sits at index $k$, which indicates that all items before that item are less than it and all items after that item are greater than it.

View Pattern →

See all patterns →