The StoneWall problem is a classic algorithmic challenge that tests your ability to recognize when a stack data structure enables a greedy O(N) solution. The Problem Given an array of wall heights, determine the minimum number of distinct stone blocks needed to construct that height profile. Each stone block can be placed multiple times at…
Understanding tradeoffs between these structures is essential for algorithm design: Memory allocation: Arrays use contiguous memory (better cache locality); linked lists scatter across memory with pointer references Access time: Array O(1) random access; linked list O(n) traversal required Insertion/deletion: Arrays require O(n) shifts; linked lists require O(1) pointer updates when position is known Size: Arrays…
Colossus is Google’s successor to the Google File System (GFS), designed to handle the massive scale of data storage across Google’s infrastructure. While GFS was documented in detail in the 2003 SOSP paper, Colossus information remains sparse in academic literature—much of what we know comes from talks and interviews with Google engineers. Colossus serves as…