Prefix Sum & Kadane's Sliding Window Two Pointers

Singly Linked List Doubly Linked List

Stack Operations Queue Operations

Monotonic Stacksoon

Binary Search Tree AVL Tree Tree Traversals Heap / Priority Queue

Collision Handlingsoon

BFS & DFSsoon

Dijkstra's Algorithmsoon

Goroutines

Overview Advanced Runtime & Leak Management

Channels Memory Model GC

MVCC & Transactions

Indexing

Overview B-Tree Index GIN Index Hash Index

Isolation Levels

Query Plannersoon

WAL & Recoverysoon

Vacuum & Bloatsoon

Data Structuressoon

Persistencesoon

Pub/Sub & Streamssoon

Cluster & Replicationsoon

Architecturesoon

Subscriptionssoon

Tiered Storagesoon

Partitions & Offsetssoon

Consumer Groupssoon

Replicationsoon

CAP Theoremsoon

Raft Consensussoon

Cache Patternssoon

Eviction Policiessoon

Golang

Memory visibility shown as shared-state tables and synchronization edges: what becomes safe, what stays racy, and why publication needs a real happens-before path.

Go: Memory Model

Pick a mode to inspect shared variables, visibility, and the synchronization primitive that does or does not make the state safe.

→ write -> synchronize -> observe