Adobe Software Engineer II SDE2 interview questions
based on 1 rating - Updated 20 Mar 2025
Difficultinterview difficulty
Mixedinterview experience
How others got an interview
100%
Applied online
Applied online
Interview search
1 interviews
Adobe interviews FAQs
Candidates applying for Software Engineer II SDE2 roles take an average of 4 days to get hired, when considering 1 user submitted interviews for this role. To compare, the hiring process at Adobe overall takes an average of 16 days.
Here are the most commonly searched roles for interview reports -
I applied online. The process took 4 days. I interviewed at Adobe (Bengaluru) in Mar 2025
Interview
I applied online without referral. Got 2 tech rounds scheduled on 6th March in one day. In the first round, the interviewer started with introduction then moved to C++ conceptual questions regarding static variables, working of delete[] keyword, smart pointers and then two Leetcode questions: 1) Subarray Sum Equals K. 2) Wildcard Matching. Then he asked a easy input output C++ question.
In second round, format was same first he C++ conceptual questions from same topics. At the he asked one DSA question: similar to design Mostly Recently Used (MRU) Queue (we had to give sum of K recently used elements)
I qualified both rounds.
Then hiring manager round was scheduled on 10th March. This round was quite unorthodox as I was expecting LLD questions, but the interviewer started with a conceptual DSA question: Given a stream of integer create BST that supports CRUD operations. I'd to give the approach verbally and also the time complexity. He also asked me to prove time complexity mathematically. He then added to same question to give the number of nodes greater than and lesser than a given node in O(1). Then he asked C++ conceptual question regarding smart pointers at very deep level. The last question was OS question, he asked was to write code (pseudocode) for M producers and N consumers where the consumer consumes the middle element. I wasn't much prepared for this question, so I got rejection in this round.
Interview questions [1]
Question 1
In the first round, the interviewer started with introduction then moved to C++ conceptual questions regarding static variables, working of delete[] keyword, smart pointers and then two Leetcode questions: 1) Subarray Sum Equals K. 2) Wildcard Matching. Then he asked a easy input output C++ question.
In second round, format was same first he C++ conceptual questions from same topics. At the he asked one DSA question: similar to design Mostly Recently Used (MRU) Queue (we had to give sum of K recently used elements)
I qualified both rounds.
Then hiring manager round was scheduled on 10th March. This round was quite unorthodox as I was expecting LLD questions, but the interviewer started with a conceptual DSA question: Given a stream of integer create BST that supports CRUD operations. I'd to give the approach verbally and also the time complexity. He also asked me to prove time complexity mathematically. He then added to same question to give the number of nodes greater than and lesser than a given node in O(1). Then he asked C++ conceptual question regarding smart pointers at very deep level. The last question was OS question, he asked was to write code (pseudocode) for M producers and N consumers where the consumer consumes the middle element. I wasn't much prepared for this question, so I got rejection in this round.