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

Binary Tree Max Sum (Medium)

Given a binary tree, return the maximum sum of any of the subtrees, including the root tree.

View Puzzle →


Brace Permutations (Medium)

Write a function to print all balanced brace combinations for a given number of braces.

View Puzzle →

See all coding puzzles →


Featured Algorithm Patterns

Breadth-First Search

A breadth-first search is an algorithm in which a data structure is modeled into a tree and traversed one level at a time, in search of an element. A depth-first traversal, by comparison, searches down toward the leaves first.

View Pattern →


Binary Search

A binary search is a DFS algorithm on a sorted data structure. However, binary search is limited to traversal through one path of the data structure and will not traverse multiple paths. A binary search splits the data down the middle and evaluates some target against the middle element. If the middle element is "less than" the target, then the target must be in the latter half of the data structure (if the data is sorted in increasing order). If the middle element is "greater than" the target, then the target must be in the earlier half of the data structure. If the middle element is "equal to" the target, then the search stops.

View Pattern →

See all patterns →