AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Adobe Software Developer Interview Questions and Answers
74 Interview questions
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
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
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
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...
Ambition Box is a platform for employee reviews and insights, monetizing content to sustain operations and provide quality services.
Ambition Box aggregates employee reviews and company insights, helping job seekers make informed decisions.
The platform offers premium content and features, which require funding to maintain and improve.
By charging for certain content, Ambition Box can invest in better tools and resou...
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()
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.
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
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
Canny's algorithm is a multi-stage edge detection technique used in image processing to identify edges in images.
1. Gaussian Blur: Reduces noise and detail in the image using a Gaussian filter.
2. Gradient Calculation: Computes the intensity gradient of the image to find potential edges.
3. Non-Maximum Suppression: Thin out the edges by keeping only the local maxima in the gradient direction.
4. Double Thresholding: ...
Adobe Software Developer Interview Experiences
20 interviews found
Anonymous
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
I appeared for an interview in Apr 2025, where I was asked the following questions.
- Q1. Why you want to work in adobe
- Ans.
I want to work at Adobe to contribute to innovative projects that empower creativity and enhance user experiences globally.
Adobe is a leader in creative software, and I admire its commitment to innovation, such as the development of Adobe Creative Cloud.
I am passionate about design and technology, and working at Adobe would allow me to combine these interests to create impactful solutions.
The collaborative culture at A...
- Q2. Why you want change or move?
- Ans.
I seek new challenges and opportunities for growth that align with my career goals and personal development.
Desire for professional growth: I want to expand my skill set and take on more complex projects.
Cultural fit: I'm looking for a company culture that values innovation and collaboration, similar to my previous experience at XYZ Corp.
Career advancement: I'm eager to move into a role with more leadership responsibil...
- Q3. Why should we hire you
- Ans.
I bring a unique blend of technical skills, problem-solving abilities, and a passion for software development that aligns with your team's goals.
Proven experience in developing scalable applications, such as a recent project where I improved load time by 30%.
Strong proficiency in multiple programming languages, including Python and Java, allowing me to adapt to your tech stack quickly.
Excellent teamwork and communicati...
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
Pushkal Shukla
Binary search tree algorithm based questions
Count number of Climb stairs
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?
- Ans.
Joining Adobe offers the chance to work with innovative technology and contribute to products that empower creativity and productivity.
Innovative Products: Adobe is known for its cutting-edge software like Photoshop and Illustrator, which are industry standards in creative design.
Commitment to Creativity: Adobe's mission to empower creativity aligns with my passion for developing tools that enhance user experience and ...
Interview Preparation Tips
Selected
I applied via Campus Placement 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
- Ans.
Ambition Box is a platform for employee reviews and insights, monetizing content to sustain operations and provide quality services.
Ambition Box aggregates employee reviews and company insights, helping job seekers make informed decisions.
The platform offers premium content and features, which require funding to maintain and improve.
By charging for certain content, Ambition Box can invest in better tools and resources ...
- 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
I appeared for an interview 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 the Middle Node from a Singly Linked List
Given a singly linked list of integers, the task is to remove the middle node from this list.
Input:
The first line of input includes an integer 'T' whic...
- 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 Problem Statement
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
... - 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 Problem Statement
You are given an integer array
ARR. Determine the length of the shortest contiguous subarray which, when sorted in ascending order, results in the entire array being sorted in a... - 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 Problem Statement
Given an integer
N, your task is to compute the number that results from swapping each even position bit ofN's binary representation with its adjacent odd bit to... - 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. 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.
Problem: Search In Rotated Sorted Array
Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer
Qqueries. Each query is represented by an integerQ[i], and you must ... - 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 Problem Statement
You are provided with an array of integers. The task is to sort the array in ascending order using the quick sort algorithm.
Quick sort is a divide-and-conquer algorithm. It ...
- 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 Binary Search Tree
You are given a binary search tree (BST) containing N nodes. Additionally, you have references to two nodes, P and Q, within this BST.
Your task is to determine the Lowest Com...
- 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 Problem Statement
You are given a
N x Mmatrix of integers. Your task is to return the spiral path of the matrix elements.Input
The first line contains an integer 'T' which denotes the nu... - 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. What is the Diamond Problem in C++ and how can it be resolved?
- 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. 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 Member Technical Staff Interview Questions
- Adobe Software Engineer Interview Questions
- Adobe Software Developer Intern Interview Questions
- Adobe Computer Scientist 2 Interview Questions
- Adobe Product Manager Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Engineer Interview Questions
- Java Developer Interview Questions
- Web Developer Interview Questions
- Senior Software Developer Interview Questions
- Application Developer Interview Questions
- Salesforce Developer Interview Questions
- Software Development Engineer Interview Questions
- Developer Interview Questions
- Show more
Overall Interview Experience Rating
based on 11 interview experiences
Difficulty level
Duration
Software Developer Interview Questions from Similar Companies
Adobe Software Developer Reviews and Ratings
based on 23 reviews
Rating in categories
|
Computer Scientist
492
salaries
|  ₹35.1 L/yr - ₹60.5 L/yr |
|
Technical Consultant
311
salaries
| ₹7.5 L/yr - ₹28.5 L/yr |
|
Computer Scientist 2
293
salaries
| ₹28 L/yr - ₹102 L/yr |
|
Software Engineer
277
salaries
| ₹8.1 L/yr - ₹30 L/yr |
|
Senior Software Engineer
248
salaries
| ₹12 L/yr - ₹44.1 L/yr |
Salesforce
Oracle
Microsoft Corporation
Amazon
- Home >
- Interviews >
- Adobe Interview Questions
