The interview consists of 4 rounds, although I only made it to round 2:

• Take-home, LeetCode-style, 2 questions
• Screenshare, C++ trivia/knowledge questions
• Screenshare, LeetCode-style question(s)
• Virtual on-site, LeetCode-style + speak with leadership

Round 1

• Given a string containing only the characters 'A', 'B', 'C', or 'D', return the string after all adjacent "AB"/"BA" and "CD"/"DC" pairs have been removed.

• Given a graph (represented as an array) where nodes have values 'A' or 'B', find the longest path where no two adjacent nodes have the same value.

Round 2

• Physical memory vs. virtual memory: You have 4GB of physical memory but allocate an 8GB buffer. Is this possible? If so, how? How is the memory actually read as you traverse it?

• Thread vs. process: What is the difference? Discuss some common threading models.

• What are some methods of inter-process communication (IPC)?

  • Between threads.
  • Between processes.

• Explain how a named pipe (FIFO) works.

• What does the inline keyword do in C++? What are its pros and cons?

• How do virtual functions work in C++? Explain how vtable lookup operates.

• std::map vs. std::unordered_map in C++: How is each implemented? What data structure is used?