Concurrency and Distributed Algorithms Questions

Covers fundamental concurrency primitives and distributed algorithm concepts that are commonly tested in system and backend interviews. Candidates should understand thread safety, race conditions, locks and lock free techniques, mutual exclusion, atomic operations, and memory visibility. In the distributed domain candidates should be able to explain consistency models such as strong consistency and eventual consistency, trade offs between consistency and availability under network partitions, partitioning and replication strategies, and common patterns for consensus and leader election. Practical problems include designing thread safe queues, concurrent counters, or distributed caches and describing how to test and debug concurrency and partial failure modes.