Whenever you're ready, walk me through how you'd approach this.
Explain the mechanics of concurrency, threading, and locks. How do you design lock-free data structures to avoid deadlock and contention?
Discuss how threads execute concurrently, how mutexes and atomic operations provide synchronization, and how you would design and validate a lock-free structure under contention. Address memory ordering, ABA, starvation, and safe reclamation of removed nodes.
Scope your answer to systems programming, using C++20 terminology and APIs where useful.