Adobe | Computer Scientist 1 | Round 1 Interview Experience

Adobe Interview Experience – C++ (CS-1 Role)

YOE: 3

The interviewer started with a quick introduction and then moved on to C++ fundamentals. We discussed:

• vector vs list vs queue: use-cases, internal structure, and time complexity of operations.
• ordered_map (i.e., std::map) vs unordered_map, including internal implementations (Red-Black Tree vs Hash Table).
• What is a VTable and how virtual functions are implemented in C++.
• Implement a Singleton class in C++, covering thread-safety. Asked for some real use case , I tolder Logger.

Coding : I believe it was a hard-level problem. Problem: Minimize the Maximum Beauty of K Subarrays Given an array, divide it into k contiguous non-empty subarrays. The beauty of a subarray is defined as: beauty = max_element × length For each split, compute the maximum beauty among the k subarrays. Among all such splits, return the minimum possible maxium beauty.

I told the approach and coded but couldn't make it work, but he was satisfied with the thought process and approach.

Toward the end, the interviewer switched to OS questions, such as:

What is virtual memory? Paging and Segmentation

Questions based on code snippets: I was asked to analyze a few C++ code pasted in the editor .

Recruiter reached out with positive feedback.