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

Stack & Queue

LIFO stack operations and bracket matching

Stack & Queue: Stack

Stack

Pick a stack operation to animate the LIFO behavior.

Stack Patterns

Push adds a new item to the top, while Pop removes from the same side of the structure.

Peek inspects the current top without mutating the stack.

Balanced Parentheses uses the stack to match every closing bracket against the latest open bracket.

Complexity

Push

Time:O(1)

Space:O(1)

Pop

Time:O(1)

Space:O(1)

Peek

Time:O(1)

Space:O(1)

Balanced Parentheses

Time:O(n)

Space:O(n)