Adobe Interview Experience and Questions

Technical round - 3

HR round - 1

Topics of Most interest : MEMORY, Optimsation, Complexities, problem solving,

Must know basic of all subjects, can ask anything from any subject like CO ,
Networks,etc.

Project awareness in depth is a must especially if its related to networking or

First 2 technical rounds were basically the same. Problems to code and suggest
better codes and optimise approaches. Any subject can be asked but the main
concern is DS, Algo and OS.

All rounds start with an elevator pitch(short Introduction) that should take them to
one of your strength projects.

Round 1 :

Introduction. (Introduced the project I am most comfortable with). Asked to explain

Asked what strings are, next if we have a linked list with each character of a string
with null ending of the string at the last, we have to reverse the linked list to form a
string again. Asked what a NULL is and how it is stored and what would occur if the
linked list in the program did not contain any element i.e. pointed to Null. What
error would occur and where and why .Discussion on the solution and code provided
for the approach followed.

If a linked list had a loop, how would u identify it . Coding of each algorithm and
optimization of the approach for better space and time complexity without storing
values was asked. after 3-4 approaches and their discussion, the problem was
extended to a doubly linked list and asked if i would change my approach and to
write a code for that as well. Then to explain why i would modify that
approach.Asked about Copy Constructor, more discussion on how the constructor
can be called, lot of questions of the calling sequence and what the constructor
would do in different situations. Asked to explain difference between a process and
a thread(a mugged up defintion would not help) explaining exactly where they
would differ and why and how of every answer. Asked if we could create a new
process from a thread. Then from the thread and use of shared resourses and
sharing of resources came questions on Critical Section. Differentiate between
mutex and semaphores and a lot of discussion on answer. Explain paging and why it
is required. A situation was provided wherein the cost of memory and the time of
getting a page was no bound, would we use paging even then.

If we have an array of integer elements with a max and a min element, we need to
find an element between the max and the min element with the least time and
space complexity. follow up questions on each approach.

Round 2:

Introduction.

Directly goes to problem solving. If we have two arrays ,A with n elements sorted. B
with a space for n+m elements and has m elements sorted. We need to add all the
elements to B in a sorted order. First i gave a basic approach, then optimised the
approach and a merge sort modification approach came up where log n as
complexity was suggeted. I was asked how log n as a complexity is formed.
Explained using binary tree height. Then better approached were asked till the
complexity came down to O(m+n) and space as O(1). Asked if i would use a quick
or a merge sort in one of the techniques. Why Quick sort was calledas Quick.
Explain how Quick sort works. How i would choose the pivot in any random
question. and in this given situation and why.

Then the interviewer looks at my resume asks if i have knowledge about servers
and google sheets. Asks how in sheets two or more people can be editors of the
sheet. Asked how the editing at the same time by two or more people would be
controlled. If instead of the sheet i had a word document where i would apply the
locks. At which level and why. And provided with a situation where my solution
would fail and asked how i would handel that situation. All data structures that
would be used for server to process requests and responses between the client and
the dbms and how the waiting and locking and editing would be maintained. where
the locks would be maintained. How requests would be mapped to responses and so
on.

The third problem was, given a memory of a 100 kb, and a class needs to be
implemented to make operations possible for all the stacks using it. What would be
the approach the base case and further questions on the approach. The problem
was then extended to 5 stacks and asked for memory implementation of the same. I
discussed all possible approaches and pros and cons of all the approaches. i was
asked to select the best and why i found it to be the best approach.

Round 3 :
Asked to introduce myself, asked about our college, how i have been performing
throughout semesters and if the results were published. Asked if already placed and
where and the package details. Asked why i joined the college my interests and
what lead me to decide to be a CS engineer. Then given an isoceless right angled
triangle with a circle inside it that touches all three sides. A smaller circle was drawn
inside the space between the right angle and the circle and the radius of the smaller
circle was asked. Only pythagoras theorem could be used without a proof all other
methods used must be proved first and then be used. after spending and not being
able to solve this question, a programming question was given wheren i was asked
about a game called bollywood where movie names need to be gussed based on
the blanks provided. First I had the opinion that the game had to be built but the
interviewer changed it to a code that needs to guess the word. Also asked about the
Data structures i would use to store movie names and why. Then I was aked about
all sorting techniques. and which should be used where and restrictions of all the
techniques. Then again the question of difference between a process and a thread
and if we could call a process from a thread and why not?. Asked to solve the
original question again.

HR round:
Were asked to ask them about adobe and the job.