Add office photos
Filter interviews by
Adobe Software Developer Interview Questions, Process, and Tips
Top Adobe Software Developer Interview Questions and Answers
- Q1. Morty and his array Rick gave Morty an array 'Arr' of length ‘N’ and an integer ‘K’ and asked him to find the minimum possible cost to split the array into non-empty sub- ...read more
- Q2. Delete middle node You have been given a singly Linked List of integers. Your task is to delete the middle node of this List. Note: 1. If there is no middle node in the l ...read more
- Q3. Sub Sort You are given an integer array ‘ARR’. You have to find the length of the shortest contiguous subarray such that, if you sort this subarray in ascending order, th ...read more
Adobe Software Developer Interview Experiences
23 interviews found
Anonymous
Interview Questionnaire
20 Questions
- Q1. He asked me my specialization?
- Q2. Why not further studies? (He had noted that I was third in my batch. He appeared impressed by that
- Q3. He asked me to tell him about my favorite project
- Q4. He then looked at my grades. He commented that my lowest grade – B- was in Digital Image Processing. I just looked at him like a doofus thinking of what to say. But he quickly added, ‘don’t worry, it happe...
- Q5. He then asked me a question that had been asked in Round 4, written test:Describe an optimal algorithm to find the second minimum number in an array of numbers. What is the exact number of comparisons requ...
- Q6. Given a polygon (could be regular, irregular, convex, concave), find out whether a particular point lies inside it or outside it
- Ans.
To determine if a point is inside a polygon, use the ray casting algorithm.
Create a line from the point to a point outside the polygon
Count the number of times the line intersects with the polygon edges
If the count is odd, the point is inside the polygon; otherwise, it is outside
- Q7. He asked me to explain Canny’s algorithm to him. (this was because my DIP project was related to this)
- Q8. Then, he gave me a practical problem to solve: Suppose you are given an image which contains some text and some photos. How do you find the location of the image?
- Q9. Which are the four storage classes in C
- Ans.
The four storage classes in C are auto, register, static, and extern.
Auto: default storage class for all local variables
Register: used to define local variables that should be stored in a register instead of RAM
Static: used to define local variables that retain their value between function calls
Extern: used to declare a global variable that is defined in another file
- Q10. Given a program: int i; int main() { int j; int *k = (int *) malloc (sizeof(int)); … } Where are each of these variables stored?
- Ans.
i is stored in global data segment, j is stored in stack, k is stored in heap.
i is a global variable and is stored in the global data segment
j is a local variable and is stored in the stack
k is a pointer variable and is stored in the stack, while the memory it points to is allocated on the heap using malloc()
- Q11. Question on polymorphisms
- Q12. He again went back to the first question he had asked me. Once again
- Q13. Then he wrote out some code and asked me how the compiler will generate code for it. I gave some answer, but he was clearly not satisfied. I thought it was all over by then. Then, he asked me a DIP quest...
- Q14. Given a set of words one after another, give me a data structure so that you’ll know whether a word has appeared already or not
- Ans.
Use a hash table to store the words and check for existence in constant time.
Create a hash table with the words as keys and a boolean value as the value.
For each new word, check if it exists in the hash table. If it does, it has appeared before. If not, add it to the hash table.
Alternatively, use a set data structure to store only the unique words and check for existence in the set.
- Q15. He asked me some questions on Interprocess Communication: What’s a semaphore? How are they used? He would often pick out words from my answers and ask me what they meant. He wanted to make sure that I rea...
- Q16. He then asked me some DB fundas. Transaction. Serializability, Consistent state, etc
- Q17. Finally, he asked me whether I had any questions
- Q18. There is a clock at the bottom of the hill and a clock at the top of the hill. The clock at the bottom of the hill works fine but the clock at the top doesn’t. How will you synchronize the two clocks. Obv...
- Q19. There was one more puzzle.. I don’t remember it. but I do remember that we started discussing ways of generating large prime numbers
- Q20. We also talked a bit about my phone browser project
Interview Preparation Tips
Duration: 15 minutes
Total Questions: 1
Round: Test
Duration: 30 minutes
Total Questions: 2
Round: Test
Duration: 30 minutes
Total Questions: 3
Round: Test
Total Questions: 4
Round: Technical Interview
Experience: 1.When I told him that I had none as I didn’t want to specialize in this stage, he was a little surprised but appeared satisfied with my reason.2.I told him that my profile clearly indicated that I’ve been trying to get into the industry via internships, industry-funded projects right from second year, second sem. I said that I was fully sure that I didn’t want to do MS anytime soon.3.I told him about the web-browser that I had developed for cell-phones. I thought that was the only project which was closest to what Adobe was working on. He appeared satisfied with my answers.4. So people, be fully prepared to explain any anomalous grades. I was prepared with the explanation of the W in the my grade-sheet but not of the B- in DIP. I know that this is really stupid considering that I was interviewing with Adobe. Don’t make this mistake.5.I screwed up, big time in this question. I had superficially discussed this question with my friend a while ago and he had outlined an algorithm which I thought that I had understood, but I hadn’t. I started off explaining it but got stuck in the middle. He sternly told me to read it up again. One solution that I could tell him, and which I had written in the test was this Use two variables – min and second min. Initialize them by comparing the first two elements of the array. This is (1) comparison. Then, go through the entire array, from index 2 to n-1 comparing each element, first with min and then with second min, updating each variable as necessary. This will involve a worst case of two comparisons for each element. Therefore, total number of comparisons = 2*(n-2) + 1 = 2*n – 3 comparisons.I’ll try to update this with a better solution, sometime soon.6.This is an easy, straight question from graphics. You shoot a ray parallel to the x-axis passing through this point. Start with odd parity. Change parity of ray each time it intersects an edge of the polygon (consider special case of when the line passes through a vertex of the polygon. Change parity only if it passes through a vertex which has one edge above it and one edge below the ray). If the parity of ray is even when it passes through the point, it is inside the polygon, else it is not.7.This is simple. Study DIP8.I gave various alternatives – from searching for RGB components, to using OCR.. he didn’t appear fully satisfied. I think he was looking for edge-detection, but that would fail, if the text contained tables, etc.
Round: Technical Interview
Experience: He was friendly at the start but this interview was my worst. He asked me my favorite subject. I said that it was Programming. (He laughed at that)
1. static, extern, register, auto2.I started off correctly, but he was able to confuse me. He brought in shared libraries, static libraries fundas into the discussion. We had a discussion for about twenty-minutes on this. Finally, he was happy with one of my answers because I had deduced which policy made sense and answered correctly. He said that out of all the people interviewed so far (I was second last), nobody had been able to answer all of these questions correctly.3.this is easy – get it from any C++ book. He tried to confuse me again, but this time I was ready and he was finally satisfied.Then he looked at my grades and said that out of all your grades, you have only two Bs and one of them is in Compilers. Why? (Damn it. three non-A grades and that’s all they ask about. What’s wrong with this world?!)Didn’t you like Compilers? “Not in particular”, I replied. “Fine. Now, I HAVE to ask you questions on compilers”, he said.4.He again went back to the first question he had asked me. Once again5.I first suggested that we capture only a small portion of the board. To locate that portion, we could search for the chalk in the prof’s hand – of course, taking care that it had the blackboard in the background (no point capturing a video of the prof scratching his chin, na?). Further, if the prof was writing only text, we could convert the video into text by OCR and then transmitting. Simple diagrams could also be reduced to a set of vector-graphics instructions (we rarely, see the prof shading stuff). I think he liked my approach, but was not completely satisfied. Anyway, we left it at that and went forward.6.I suggested various alternatives. but he kept helping me and finally, we came up with an array of pointers to 26-trees (each node of the tree has 26 children). Store every word as a path from the root to a leaf with pointers in the correct places. For example, hello would be stored as – pointer from ‘h’ index of the root array to a node which had a pointer from ‘e’ index of it’s array to a node which had a pointer from ‘l’ index of the array.. and so on. This is both time and space efficient.7.I was able to answer all his questions, but I made the mistake of telling him, when we started off that I didn’t know much about this subject as I had done it a long time ago. He was very annoyed at that, apparently because a lot of people before me had said this.8.I was able to answer all of them. I stumbled around a bit in a few questions where I was explaining correctly, but not using the keywords that he was looking for.9.I thought that I should say something to make him realize that I was not completely stupid and so asked him whether there was any logic to the order in which the short-listed candidates were called. This turned out to be a dumb move. The order was alphabetic and he sent me off with a parting shot, saying “You guys do pattern recognition and stuff and still you can’t recognize such a simple pattern” Me and my big mouth! Moral of the story: Don’t ask questions for the sake of asking.
Round: Puzzle Interview
Experience: After the first two interviews, this one was like having a warm batch after being cold and wet for days! I did well in this one.1.You have to go up the hill and come back, with horse, without horse, getting four equations to solve four unknowns – time to go uphill – with horse, without horse, time to go downhill – with horse, without horse. Then you can go up the hill and set the clock to ‘(time when you left) + (time to go uphill with horse)’2. I told him the funda of Mersenee primes (luckily remembered it) and he was decently impressed.
General Tips: Finally hired by Adobe. Special thanks to AmbitionBox team. Really amazing site for sharing experience. That’s all for the Adobe. They are focusing on your approach and your coding skills. All the best.
Skills: Algorithm, Data structure, C++, C, DIP
College Name: BIT Mesra
Skills evaluated in this interview
I applied via Referral and was interviewed in Sep 2024. There were 2 interview rounds.
2medium level questions
(2 Questions)
- Q1. Project discussion for 30 mins
- Q2. Dsa problem medium level
swetha shanmugam
I applied via LinkedIn and was interviewed in May 2024. There were 2 interview rounds.
Leet code questions. Basic Questions was easy
(2 Questions)
- Q1. Give an array of integers arr1, find a new array where array[i] = multiplication of all entries arr1 except arr1[i] without using division operator
- Ans.
To find a new array where each element is the product of all elements in the original array except the element at that index without using division operator.
Iterate through the array and calculate the product of all elements to the left of the current index for each element.
Iterate through the array in reverse and calculate the product of all elements to the right of the current index for each element.
Multiply the resu...
- Q2. Given a wholly sorted two dimensional array , find the index of given element or return -1 if not present
- Ans.
Search for an element in a sorted 2D array and return its index if found
Start from the top right corner and compare the target element with the current element
If the target is smaller, move left; if larger, move down
Repeat until the element is found or all elements are checked
Skills evaluated in this interview
N. Sandeep
Basic maths , physics and core subjects and e.t.c
Basic coding array, strings , linked list , stack , queue
Adobe interview questions for designations
Pushkal Shukla
Binary search tree algorithm based questions
Get interview-ready with Top Adobe Interview Questions
Count number of Climb stairs
Software Developer Jobs at Adobe
I applied via LinkedIn and was interviewed before Sep 2023. There were 3 interview rounds.
Work life balance among employees
(2 Questions)
- Q1. Unique path in a grid
- Ans.
Find the number of unique paths in a grid from top left to bottom right
Use dynamic programming to store the number of paths to each cell
At each cell, the number of paths is the sum of paths from the cell above and the cell to the left
Example: For a 3x3 grid, there are 6 unique paths
- Q2. Maximum product in subarrray
- Ans.
Find the maximum product of a subarray within an array of strings.
Iterate through the array and keep track of the maximum product so far
Consider both positive and negative numbers in the subarray
Handle edge cases like all negative numbers or empty array
(2 Questions)
- Q1. Questions on projects
- Q2. Question on sql and dbms
Skills evaluated in this interview
I applied via Campus Placement
Regular one nothing much to specify (1dp , 2 normal questions)
Discussed about my project based on django
(1 Question)
- Q1. Why u want to join in adobe?
Interview Preparation Tips
Placement Interview
Selected
I applied via campus placement at National Institute of Technology, (NIT), Nagaland and was interviewed before Sep 2022. There were 2 interview rounds.
DSA SHOULD BE DONE DEEPLY AND
(5 Questions)
- Q1. WHAT IS OOPS WHY OOPS WHY NOT OOPS
- Ans.
OOPS stands for Object-Oriented Programming. It is a programming paradigm that uses objects and classes for code organization and reusability.
OOPS allows for better code organization and reusability through the use of classes and objects.
Encapsulation, inheritance, and polymorphism are key principles of OOPS.
Examples of OOPS languages include Java, C++, and Python.
- Q2. WHAT IS DBMS WHY DBMS WHY NOT DBMS
- Ans.
DBMS stands for Database Management System. It is used to manage and organize data efficiently. It provides data security, integrity, and easy access.
DBMS helps in organizing and managing data efficiently.
It ensures data security and integrity by providing access control and data encryption.
DBMS allows for easy retrieval and manipulation of data through query languages like SQL.
Examples of DBMS include MySQL, Oracle, a
- Q3. WHAT IS AMBITION BOX WHY NOT THEY PROVODING CONTENT FOR FREE
- Q4. WHAT IS DSA WHAT IS WEB DEVELOPMENT
- Ans.
DSA stands for Data Structures and Algorithms. Web development is the process of creating websites and web applications.
DSA involves organizing and storing data efficiently for quick access and manipulation
Web development includes front-end (client-side) and back-end (server-side) development
Examples of DSA include arrays, linked lists, and sorting algorithms
Examples of web development technologies include HTML, CSS, J
- Q5. WHAT IS SIEVE OF ERATOSTHENESE
- Ans.
Sieve of Eratosthenes is an algorithm for finding all prime numbers up to a given limit.
Algorithm eliminates multiples of each prime number starting from 2
Remaining numbers are prime
Example: Finding prime numbers up to 30 - 2, 3, 5, 7, 11, 13, 17, 19, 23, 29
Interview Preparation Tips
- DSA
- REACT
- Web Technologies
Skills evaluated in this interview
CodingNinjas
I was interviewed in Jun 2021.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This round had 2 questions of DSA . Both the questions were from Linked Lists. I was first asked to explain my approach and then code up the both the problems.
- Q1. Delete middle node
You have been given a singly Linked List of integers. Your task is to delete the middle node of this List.
Note:
1. If there is no middle node in the list to delete, return an empty l... - Ans.
The task is to delete the middle node of a singly linked list of integers.
If the linked list is empty or has only one node, there is no middle node to delete.
To delete the middle node, we need to find the middle node and update the pointers of the previous and next nodes.
To find the middle node in one traversal, we can use two pointers - a slow pointer and a fast pointer.
The slow pointer moves one node at a time, while...
- Q2. Merge Two Sorted Linked Lists
You are given two sorted linked lists. You have to merge them to produce a combined sorted linked list. You need to return the head of the final linked list.
Note:
The give... - Ans.
The task is to merge two sorted linked lists into a single sorted linked list.
Create a new linked list to store the merged list
Compare the values of the nodes from both lists and add the smaller value to the new list
Move the pointer of the list with the smaller value to the next node
Repeat the comparison and addition until one of the lists is empty
Add the remaining nodes from the non-empty list to the new list
Return th
(3 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This round had 2 coding questions , the first one was related to Sorting and the second one was related to Compilers and C++ in general to check endianess of the machine actually . After the coding questions, I was asked some concepts related to OOPS in general.
- Q1. Sub Sort
You are given an integer array ‘ARR’. You have to find the length of the shortest contiguous subarray such that, if you sort this subarray in ascending order, then the whole array will be sorted i...
- Ans.
The task is to find the length of the shortest contiguous subarray that needs to be sorted in order to sort the entire array.
Iterate through the array from left to right and find the first element that is out of order.
Iterate through the array from right to left and find the first element that is out of order.
Find the minimum and maximum elements within the subarray defined by the above two elements.
Expand the subarray...
- Q2. Swap Adjacent Bit Pairs
You are given an integer 'N'. Your task is to find the number formed after swapping each even bit of 'N' in its binary representation with its adjacent bit on the ri...
- Ans.
The task is to swap each even bit of an integer with its adjacent bit on the right in its binary representation.
Convert the given integer to its binary representation
Iterate through the binary representation and swap each even bit with its adjacent bit on the right
Convert the modified binary representation back to an integer
Print the resulting integer
- Q3. OOPS Question
What are Virtual Destructors in C++?
- Ans.
Virtual destructors in C++ are used to ensure that the correct destructor is called when deleting an object through a pointer to its base class.
Virtual destructors are declared in the base class and are used when deleting an object through a pointer to the base class.
They allow proper destruction of derived class objects.
Without virtual destructors, only the base class destructor would be called, leading to memory leak...
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
Standard DS/Algo round with 2 questions . First I explained my approach and then we discussed some Edge Cases along with proper Complexity Analysis.
- Q1. Search In Rotated Sorted Array
Aahad and Harshit always have fun by solving problems. Harshit took a sorted array and rotated it clockwise by an unknown amount. For example, he took a sorted array = [1, 2,...
- Ans.
This is a problem where a sorted array is rotated and we need to search for given numbers in the array.
The array is rotated clockwise by an unknown amount.
We need to perform binary search to find the index of the given numbers.
If the number is found, return its index. Otherwise, return -1.
The time complexity of the solution should be O(logN).
- Q2. Quick Sort
You are given an array of integers. You need to sort the array in ascending order using quick sort.
Quick sort is a divide and conquer algorithm in which we choose a pivot point and partition ...
- Ans.
The question asks to implement quick sort algorithm to sort an array of integers in ascending order.
Quick sort is a divide and conquer algorithm
Choose a pivot point and partition the array into two parts
Recursively sort the left and right parts of the array
Implement the quick sort algorithm to sort the given array
(4 Questions)
Round duration - 60 minutes
Round difficulty - Medium
This round went for about 50-60 minutes where I had to code two questions related to DSA after discussing their approaches and time and space complexities and then I was asked some questions revolving around OOPS and OS . The interviewer was quite freindly and helped me at some places where I was facing some difficulties.
- Q1. LCA In A BST
You are given a binary search tree of integers with N nodes. You are also given references to two nodes P and Q from this BST.
Your task is to find the lowest common ancestor(LCA) of these t...
- Ans.
The task is to find the lowest common ancestor (LCA) of two given nodes in a binary search tree (BST).
The LCA is the lowest node that has both given nodes as descendants.
In a BST, the left subtree of a node contains only nodes with data less than the node's data, and the right subtree contains only nodes with data greater than the node's data.
Start from the root node and compare it with the given nodes. If both nodes a...
- Q2. Spiral Matrix
You are given a N x M matrix of integers, return the spiral path of the matrix
Example Of Spiral Path
Input Format:
The first line contains an integer 'T' which denotes the numb... - Ans.
The task is to return the spiral path of a given matrix.
Iterate through the matrix in a spiral pattern, starting from the outermost layer and moving towards the center.
Keep track of the current row, column, and the boundaries of the remaining unvisited matrix.
Print the elements in the spiral path as you traverse the matrix.
- Q3. OOPS Question
What is Diamond Problem in C++ and how do we fix it?
- Ans.
The Diamond Problem is a conflict that occurs when a class inherits from two classes that have a common base class.
The Diamond Problem arises in multiple inheritance.
It occurs when a class inherits from two classes that have a common base class.
This leads to ambiguity in accessing the common base class members.
To fix the Diamond Problem, virtual inheritance is used.
Virtual inheritance ensures that only one instance of
- Q4. OS Question
What are the different types of semaphores ?
- Ans.
Semaphores are synchronization primitives used in operating systems to control access to shared resources.
Binary semaphore: Can take only two values, 0 and 1. Used for mutual exclusion.
Counting semaphore: Can take any non-negative integer value. Used for resource allocation.
Mutex semaphore: A binary semaphore used for mutual exclusion.
Named semaphore: A semaphore that can be accessed by multiple processes.
Unnamed semap...
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Top trending discussions
Adobe Interview FAQs
Some of the top questions asked at the Adobe Software Developer interview -
The duration of Adobe Software Developer interview process can vary, but typically it takes about less than 2 weeks to complete.
Tell us how to improve this page.
Adobe Interviews By Designations
- Adobe Software Developer Interview Questions
- Adobe Product Intern Interview Questions
- Adobe Computer Scientist Interview Questions
- Adobe Software Engineer Interview Questions
- Adobe Computer Scientist 2 Interview Questions
- Adobe Member Technical Staff Interview Questions
- Adobe Product Manager Interview Questions
- Adobe Software Developer Intern Interview Questions
- Show more
Adobe Software Developer Interview Process
based on 6 interviews in last 1 year
1 Interview rounds
- Coding Test Round
People are getting interviews through
Software Developer Interview Questions from Similar Companies
Fast track your campus placements
Adobe Software Developer Reviews and Ratings
based on 15 reviews
Rating in categories
|
Computer Scientist
436
salaries
|  ₹21.2 L/yr - ₹70.7 L/yr |
|
Technical Consultant
289
salaries
| ₹11.5 L/yr - ₹27.5 L/yr |
|
Software Engineer
256
salaries
| ₹7.5 L/yr - ₹25 L/yr |
|
Computer Scientist 2
226
salaries
| ₹28 L/yr - ₹101 L/yr |
|
Senior Technical Consultant
190
salaries
| ₹12.5 L/yr - ₹45 L/yr |
Salesforce
Oracle
Microsoft Corporation
Amazon
Calculate your in-hand salary
- Home >
- Interviews >
- Adobe Interview Questions >
- Adobe Software Developer Interview Questions
