InterviewStack.io LogoInterviewStack.io

Consensus and Coordination Algorithms Questions

How independent nodes agree on shared state: Paxos and Raft, leader election, quorum reads and writes, distributed locks, and coordination services such as ZooKeeper or etcd. Covers split-brain avoidance, fencing tokens, and the cost of coordination on throughput and latency. Frames when consensus is required versus when it can be designed away.

HardTechnical
38 practiced

Compare using an external consensus system (e.g., etcd or Consul) vs building a lightweight custom leader-coordinator for configuration propagation and leader election for a control-plane service. Evaluate reliability, operational burden, latency, complexity, and development cost.

HardSystem Design
45 practiced

Design a scalable metadata service for distributed job coordination that supports leader election, per-job metadata sharding, and low-latency reads. Discuss consensus choices (Raft vs Paxos vs managed services), how to avoid single-leader bottlenecks, backup/restore, and handling leader CPU/memory overload.

HardTechnical
51 practiced

Compare Raft, Paxos, and gossip-based protocols for coordinating a highly available metadata orchestrator. Discuss safety and liveness guarantees, complexity of implementation, performance under partitions, and operational considerations such as leader management and debugging. Recommend the most suitable approach for schema coordination and justify your choice.

That is every published Consensus and Coordination Algorithms question for Data Engineer so far. Browse the other topics in this category, or practice this one interactively.