Adobe | Computer Scientist 1 | Round 2 Interview Experience [Rejected]
- Posted
- 14 May 2025
Summary
I interviewed for the Computer Scientist 1 role at Adobe, focusing on C++, OS, and problem-solving, which included a deep dive into smart pointers and a coding question on Cousins in Binary Tree. Despite completing the coding task, I was rejected.
How it went
Technical Interview – Problem Solving, C++, OS
Interviewer Experience: ~19 years
Status: Rejected
Recruiter told : There is no detailed feedback as of now. If there is anything that can be shared, we will make sure to do so as soon as possible.
I don't know what does it mean. It's been more than two days.
C++ Question (15–20 mins)
The interviewer started with a deep dive into C++ smart pointers, specifically focusing on std::unique_ptr and move semantics.
He shared a code snippet and asked:
Will this code compile and work? If not, why? How would you fix it?
We discussed various things around ownership transfer,and how std::move interacts with unique_ptr.
Also, about modern C++ memory management.
Pass by refernece and pass by value.
Coding Question: Cousins in Binary Tree - Given a binary tree and a target node ptr, return all its cousins
I first proposed a 2-pass BFS approach. We then briefly discussed how it could be optimized to a 1-pass BFS by tracking parent and level simultaneously. There was a bit of miscommunication while I was trying to explain the 1-pass version, so the interviewer asked me to code the 2-pass approach, which I completed.
Link to Round 1 Interview Experience : https://leetcode.com/discuss/post/6722120/adobe-computer-scientist-1-round-1-inter-xjos/
Recruiter didn't share any feedback
Questions asked (2)
- 01
C++ Smart Pointers and Move Semantics
Other
The interviewer started with a deep dive into C++ smart pointers, specifically focusing on std::unique_ptr and move semantics. He shared a code snippet and asked: Will this code compile and work? If not, why? How would you fix it? Discussion included ownership transfer, how std::move interacts with unique_ptr, modern C++ memory management, pass by reference, and pass by value.
- 02
Cousins in Binary Tree
Data Structures & Algorithms
Given a binary tree and a target node ptr, return all its cousins.