There were two rounds in the selection process. The first was an online assessment that included medium-level DSA questions and theoretical MCQs related to DSA and OOPS concepts. Out of all the participants, 35 were shortlisted for the interview round. Due to time constraints, only one interview round was conducted, which lasted for about 50 minutes.
The interview began with a brief introduction from the interviewer, followed by my self-introduction. I discussed my relevant software background, highlighting some of the projects I had worked on. One of the projects, focused on web development, was discussed in detail for nearly 20 minutes.
Next, the interviewer presented me with problem statements. The first problem, "Max Consecutive Ones," was straightforward. I provided the solution within 2 minutes, coded it up, and performed a dry run on the test cases and edge cases. I also discussed the time and space complexities of the solution.
The interviewer then asked about my favourite data structures. Although I was initially inclined to mention graphs, I opted for arrays instead due to concerns about going too deep. This led to questions about binary trees. I was asked to solve a problem on finding the maximum number of elements in the longest path in a binary tree. I initially described a brute-force solution but was prompted to optimize it and reduce the space complexity. After some thought, I provided an optimized approach, coded it, and addressed some edge cases that I had initially overlooked. The interviewer was satisfied with the final solution.
At the end of the interview, the interviewer inquired about my interest in Adobe. I expressed my enthusiasm for Adobe’s ongoing research and my desire to be a part of it.
Two days later, I received the news that I was selected. The placement office informed me, and I accepted the offer.
Advice for future candidates: Think out loud and share your thought process. Sometimes, the interviewers are more interested in your approach than the exact solution. Don’t hesitate to improve upon your initial solution as you discuss it. Thank you for reading.