Prev Next

Golang / GoLang Concurrency Mastery Interview Questions

Implement a lock-free stack using atomic CAS operations and explain the ABA problem.

A lock-free data structure uses compare-and-swap (CAS) instead of mutexes — concurrent access without blocking. This is an advanced topic demonstrating deep understanding of memory ordering and Go's atomic package.

// Lock-free stack using atomic.Pointer (Go 1.19+)
type node[T any] struct {
    val  T
    next *node[T]
}

type LockFreeStack[T any] struct {
    head atomic.Pointer[node[T]]
}

func (s *LockFreeStack[T]) Push(val T) {
    n := &node[T]{val: val}
    for {
        old := s.head.Load()       // atomic read of current head
        n.next = old               // link new node to current head
        if s.head.CompareAndSwap(old, n) {
            return // success: head changed from old to n atomically
        }
        // CAS failed: another goroutine modified head; retry
    }
}

func (s *LockFreeStack[T]) Pop() (T, bool) {
    for {
        old := s.head.Load()
        if old == nil { var z T; return z, false }
        if s.head.CompareAndSwap(old, old.next) {
            return old.val, true
        }
    }
}

// ABA PROBLEM:
// Goroutine 1 reads head = A; pauses
// Goroutine 2: pops A, pushes B, pops B, pushes A again (same pointer!)
// Goroutine 1 resumes: CAS sees head == A → "unchanged" → succeeds
// But B has been removed — the stack is now corrupted

// WHY GO'S GC PREVENTS THE ABA PROBLEM:
// The GC does not reuse memory from a node until ALL pointers to it are gone
// If Goroutine 1 holds a reference to node A, A's memory is not recycled
// So when CAS sees the same pointer, it is guaranteed to be the same object
// → ABA is largely eliminated in GC-managed languages
What does atomic.Pointer.CompareAndSwap(old, new) guarantee?
Why does Go's garbage collector largely eliminate the ABA problem in lock-free structures?

Invest now in Acorns!!! 🚀 Join Acorns and get your $5 bonus!

Invest now in Acorns!!! 🚀
Join Acorns and get your $5 bonus!

Earn passively and while sleeping

Acorns is a micro-investing app that automatically invests your "spare change" from daily purchases into diversified, expert-built portfolios of ETFs. It is designed for beginners, allowing you to start investing with as little as $5. The service automates saving and investing. Disclosure: I may receive a referral bonus.

Invest now!!! Get Free equity stock (US, UK only)!

Use Robinhood app to invest in stocks. It is safe and secure. Use the Referral link to claim your free stock when you sign up!.

The Robinhood app makes it easy to trade stocks, crypto and more.


Webull! Receive free stock by signing up using the link: Webull signup.

More Related questions...

Explain Go's GMP scheduler model. What are M, P, and G and how do they interact? What is work stealing in Go's scheduler and why does it matter for performance? Why can Go run millions of goroutines while equivalent OS-thread workloads fail? What is the difference between unbuffered and buffered channels in Go? What happens when you send to, receive from, or close a nil or closed channel? How does the select statement work in Go and what are its key properties? What is a data race in Go, how do you detect it, and what are the three main fixes? When do you use sync.Mutex versus sync.RWMutex, and what are the critical usage rules? How does sync.WaitGroup work and what are the most common mistakes? What is sync.Once and what guarantees does it provide? What causes deadlocks in Go and how do you detect and prevent them? What are directional channels in Go and why use them in function signatures? What causes goroutine leaks and how do you prevent and detect them? Implement fan-out and fan-in concurrency patterns in Go. How do you use a nil channel in select to dynamically enable or disable cases? When should you use the sync/atomic package instead of sync.Mutex? Implement a bounded worker pool pattern in Go. What are the differences between time.After, time.NewTimer, and time.NewTicker, and which leaks resources? How does context.Context enable clean goroutine cancellation and why is 'defer cancel()' critical? How do you use a buffered channel as a semaphore to limit goroutine concurrency? What is the 'done channel' pattern and why has context.Context largely superseded it? What is the goroutine loop-variable capture bug and how do you fix it? How does golang.org/x/sync/errgroup simplify concurrent error handling? When should a channel carry 'chan struct{}' versus a typed value, and why is close() used for broadcast? What is GOMAXPROCS, how does it affect parallelism, and what is the container pitfall? How does Go's select handle multiple ready cases, and how do you implement true priority? What is sync.Cond and when do you use it instead of channels? Implement Go's canonical pipeline pattern with cancellation from the Go blog. What is Go's memory model and why does it matter for concurrent code? What is the check-then-act race condition (TOCTOU) and how do you fix it? What is asynchronous preemption in Go (1.14+) and why was it introduced? How do you safely use a map from multiple goroutines in Go? How do you use a buffered channel as a task queue with natural backpressure? How does Go handle goroutines that make blocking syscalls — what happens to M and P? Implement a simple publish-subscribe broker using Go channels. What is the lock-held-during-I/O anti-pattern and how do you fix it? Write a complete example of implementing operation timeouts in Go using select. How do you write tests that detect goroutine leaks automatically? Implement a concurrent word count across multiple files — a classic Go interview puzzle. How does GOMAXPROCS=1 change behaviour and when is it actually useful? How do you implement a high-performance sharded concurrent map in Go? What are the specific happens-before guarantees for channel operations in Go's memory model? How do you implement a hedged request pattern using select and goroutines? How does sync.Pool reduce GC pressure in high-throughput Go services? What is a livelock and how does it differ from a deadlock in Go programs? How do you implement backpressure in Go to prevent overloading downstream systems? Implement a lock-free stack using atomic CAS operations and explain the ABA problem. Summarise: channel vs mutex decision guide, and the top concurrency pitfalls.
Show more question and Answers...

GoLang Production Patterns and Web Standards Interview Questions

Comments & Discussions