Reviews
Searching for a short pattern inside a long string is a classic computer science task. A straightforward comparison can repeatedly inspect the same characters,…
Prim’s algorithm is a greedy graph algorithm for finding a minimum spanning tree (MST) in a connected, weighted, undirected graph. It starts with one vertex…
A minimum spanning tree (MST) connects every vertex in a weighted, undirected graph while using the smallest possible total edge weight. It contains no cycles,…
Sorting is one of those jobs that looks trivial until the dataset arrives. A list of twelve delivery priorities is no trouble; a million order records with the…
Levenshtein distance measures how much two strings differ by counting the smallest number of single-character insertions, deletions and substitutions needed to…
A palindrome reads the same forwards and backwards. A longest palindromic substring is the longest contiguous block within a string that is palindromic; a…
Every journey through a street network, dungeon, warehouse, or robot floor can be reduced to a graph problem. A* search combines the cost already travelled…
Directed graphs model dependencies, routes and communication: a build waits for a library, a payment waits for a bank, and a delivery waits for a depot.…
Lossless data compression stores information in a smaller representation that can be restored exactly. It matters whenever every original detail must survive:…
A build pipeline rarely contains only one instruction. A compiler may need headers, a test suite may need compiled artefacts, and a deployment may require…