Concurrency comes up in most C++ interviews past the first round, and the questions repeat: what is a data race, how do you avoid deadlock, when is an atomic enough and when do you need a mutex, how do you make threads wait for each other. These eight start with the concepts and end with the classic build-it questions. Interviewers look for the edge cases: the same object passed twice, a spurious wakeup, a snapshot taken between two updates.
Threads here are simulated. Your program runs on one real thread while a scheduler switches between your threads at shared reads and writes, locks, atomic operations, waits, yields and sleeps, and every test runs under 12 different schedules. The order things can happen in, races at those points and deadlocks are faithful. Real parallel speed-up and weak memory-order effects are not.