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

Go GC shown as a heap table plus collector lanes: how tri-color marking works, why write barriers preserve correctness, where short STW phases still exist, and how heap pressure plus tuning knobs like GOGC shape assist debt and production behavior.

Go: Garbage Collector

Pick a GC mode to inspect collector lanes, heap-object colors, write-barrier preservation, and how pacing plus GOGC tuning turn heap growth into bounded concurrent work.

→ allocate -> mark -> pace -> sweep