Phone Screen interview conducted over a phone call, general questions were asked, Phone Screen interview conducted over a phone call, general questions were askedPhone Screen interview conducted over a phone call, general questions were asked
I applied through other source. The process took 1 week. I interviewed at Adobe (Bukarest, ) in Dec 2024
Interview
I was asked/schduled to take this online meeting interview on Teams even though I did not apply to it and had literally no idea how could I prepare for it, so it was freestyle. It was near the Christmas break so they told me that I should expect an answer after 6th January and never got one. After this interview, there was supposed to be another interview with the technical lead, but there was not.
Interview questions [1]
Question 1
It was a casual technical conversation with two middle engineeres about networking and what should I do to protect the intrenal netwrok of the company, ideatically speaking.
They asked me about what is a VPN, what is a gateway, what do I know about the antivirus and protection services available.
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.