Crdt interview questions

Build increment and decrement counters that merge by per-node maxima into a conflict-free convergent total.

Build a last-write-wins map whose entries merge by timestamp with a deterministic node-id tiebreak.

Build an observed-remove set where a concurrent add and remove converge with the add winning.

Order distributed events with vector clocks, detecting whether two events are causal or concurrent.

Build a replicated growable array for text whose positional-id inserts and deletes converge across replicas.