Upload Button Icon Add office photos

Adobe

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Adobe Software Engineer Interview Questions, Process, and Tips

Updated 15 Aug 2024

Top Adobe Software Engineer Interview Questions and Answers

  • Q1. given sudoku as id array of size . in a given empty cell find the possible numbers that could be possible. Asked me to write code for it
  • Q2. In an Array of size 95 contain numbers in range 1 to 100. each number is at max once in the array. find the 5 missing numbers in array between 1-100
  • Q3. given 4 unsigned integers find their integer average (eg. (2,2,2,3) => (2+2+2+3)/4 = 2) consider integer division ) without typecasting
View all 12 questions

Adobe Software Engineer Interview Experiences

6 interviews found

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(2 Questions)

  • Q1. Coding question based on stacks
  • Q2. Java and Spring Boot questions..too much grilling
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
No response

I applied via Company Website and was interviewed before Jun 2023. There was 1 interview round.

Round 1 - Coding Test 

3 DSA rounds based on trees, maps, dynamic programming on trees/ graphs and prepare well by practicing on GFG, leetcode and all.

Software Engineer Interview Questions Asked at Other Companies

asked in Qualcomm
Q1. Bridge and torch problem : Four people come to a river in the nig ... read more
asked in Capgemini
Q2. In a dark room,there is a box of 18 white and 5 black gloves. You ... read more
asked in TCS
Q3. Find the Duplicate Number Problem Statement Given an integer arra ... read more
Q4. Tell me something about yourself. Define encapsulation. What is i ... read more
asked in Paytm
Q5. Puzzle : 100 people are standing in a circle .each one is allowed ... read more
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I was interviewed before May 2023.

Round 1 - Coding Test 

Code to find majority element

Round 2 - Design 

(1 Question)

  • Q1. Design chat based solutoin
  • Ans. 

    Design a chat based solution for communication between users.

    • Implement real-time messaging functionality

    • Include features like group chats, file sharing, and message encryption

    • Design a user-friendly interface with customizable settings

    • Integrate with notification systems for instant updates

    • Ensure scalability and security of the platform

  • Answered by AI

Skills evaluated in this interview

I applied via Walk-in and was interviewed in May 2021. There was 1 interview round.

Interview Questionnaire 

3 Questions

  • Q1. Implement vector class.
  • Ans. 

    A vector class can be implemented using an array to store and manipulate a dynamic list of elements.

    • The class should have methods to add, remove, and access elements.

    • It should also have methods to resize the array as needed.

    • The class can be templated to allow for different data types.

    • Example: vector myVector;

    • Example: myVector.push_back(5);

  • Answered by AI
  • Q2. What is constructor?
  • Ans. 

    A constructor is a special method that is used to initialize objects of a class.

    • Constructors have the same name as the class they belong to.

    • They are called automatically when an object is created.

    • They can take parameters to initialize the object's state.

    • If a class does not have a constructor, a default one is provided.

    • Constructors can be overloaded to provide different ways of initializing objects.

  • Answered by AI
  • Q3. Is any virtual destructor?
  • Ans. 

    Yes, a virtual destructor is used to ensure proper destruction of derived class objects.

    • A virtual destructor is declared with the virtual keyword in the base class.

    • It ensures that the destructor of the derived class is called before the base class destructor.

    • Without a virtual destructor, memory leaks and undefined behavior can occur.

    • Example: class Base { virtual ~Base() {} }; class Derived : public Base { ~Derived() {}...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - keep real anf work hard

Skills evaluated in this interview

Adobe interview questions for designations

 Lead Software Engineer

 (2)

 Software Engineer Trainee

 (1)

 Software Quality Engineer

 (1)

 Software Engineer II

 (1)

 Software Engineer Intern

 (1)

 Software Development Engineer II

 (1)

 Software Developer

 (19)

 Mts Software Engineer

 (3)

Software Engineer Interview Questions & Answers

user image Devendra Bendkhale

posted on 4 Dec 2015

Interview Questionnaire 

8 Questions

  • Q1. WRITE A GENERIC SWAP FUNCTION
  • Ans. 

    A generic swap function swaps two values of any data type.

    • The function should take two parameters of any data type.

    • Use a temporary variable to store the value of one parameter.

    • Assign the value of the second parameter to the first parameter.

    • Assign the value of the temporary variable to the second parameter.

  • Answered by AI
  • Q2. SEARCH AN ELEMENT IN ROTATED SORTED LINKLIST .
  • Ans. 

    Search for an element in a rotated sorted linked list.

    • Find the pivot point where the list is rotated.

    • Divide the list into two sublists based on the pivot point.

    • Perform binary search on the appropriate sublist.

    • Handle edge cases such as empty list and list with only one element.

  • Answered by AI
  • Q3. SEARCH AN ELEMENT IN ROTATED SORTED ARRAY. WRITED A CODE FOR IT
  • Ans. 

    Search an element in a rotated sorted array

    • Find the pivot point where the array is rotated

    • Divide the array into two sub-arrays based on pivot point

    • Perform binary search on the appropriate sub-array

    • Repeat until element is found or sub-array size is 1

  • Answered by AI
  • Q4. In an Array of size 95 contain numbers in range 1 to 100. each number is at max once in the array. find the 5 missing numbers in array between 1-100
  • Ans. 

    Find 5 missing numbers in an array of size 95 containing numbers in range 1 to 100.

    • Create a boolean array of size 100 and mark the present numbers

    • Iterate through the boolean array and find the missing numbers

    • Alternatively, use a HashSet to store the present numbers and find the missing ones

  • Answered by AI
  • Q5. Given sudoku as id array of size . in a given empty cell find the possible numbers that could be possible. Asked me to write code for it
  • Ans. 

    Given a Sudoku board, find possible numbers for an empty cell.

    • Iterate through empty cells and check possible numbers using row, column, and box constraints.

    • Use a set to keep track of possible numbers for each empty cell.

    • Return the set of possible numbers for the given empty cell.

  • Answered by AI
  • Q6. Given 4 unsigned integers find their integer average (eg. (2,2,2,3) => (2+2+2+3)/4 = 2) consider integer division ) without typecasting
  • Ans. 

    Find integer average of 4 unsigned integers without typecasting

    • Add all the integers and divide by 4

    • Use bit shifting to divide by 4

    • Handle overflow by using long long data type

    • Use unsigned int data type for input

  • Answered by AI
  • Q7. Write a code to identify wheter given processor is of 32 bit architecture or 64 bit architecture
  • Ans. 

    Code to identify 32 bit or 64 bit architecture of a processor

    • Check if the operating system is 32 bit or 64 bit

    • If OS is 32 bit, processor is 32 bit

    • If OS is 64 bit, check if processor supports 64 bit architecture

    • Use CPUID instruction to check if processor supports 64 bit architecture

  • Answered by AI
  • Q8. Convert a binary number into base 64 integer
  • Ans. 

    Convert binary number to base 64 integer

    • Divide the binary number into groups of 6 bits

    • Convert each group of 6 bits to decimal

    • Map the decimal value to the corresponding base 64 character

    • Concatenate the base 64 characters to form the final integer

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: SIMPLE CODING QUESTIONS SPEED MATTERS.
Duration: 60 minutes
Total Questions: 3

Skills: Analytics And Coding
College Name: IIT Guwahati

Skills evaluated in this interview

Get interview-ready with Top Adobe Interview Questions

Interview Questionnaire 

6 Questions

  • Q1. Solving puzzles(25 horses,ant and sweets,height of a building..) try as many as possible before appearing for interview
  • Q2. If experienced , then project details of previous companies a must prepare question
  • Q3. Writing test cases for random scenarios
  • Q4. Programming in whatsoever language you r comfortable with, basic coding problems of DS,Algos. eg. Zigzag tree traversal algo,random linked list copy
  • Q5. Some people asked me questions related to the work i will do if hired in the project
  • Q6. Be genuine in ur CV, and be prepared with everything you write there.

Interview Preparation Tips

College Name: Na

Interview questions from similar companies

Interview Questionnaire 

21 Questions

  • Q1. AVL tree balance checking
  • Q2. Median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity
  • Ans. 

    Find median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity

    • Use binary search to find the partition point in both arrays

    • Calculate the median based on the partition point and array sizes

    • Adjust the partition points based on the median value

    • Repeat until the partition points are at the median

    • Handle edge cases such as empty arrays and uneven array sizes

  • Answered by AI
  • Q3. Strings Anagram in O(1) space complexity
  • Ans. 

    Anagram of strings in O(1) space complexity

    • Use a fixed size array of integers to store the frequency of characters in the first string

    • Iterate through the second string and decrement the frequency of each character in the array

    • If all the frequencies are zero, then the strings are anagrams

    • Return true or false accordingly

  • Answered by AI
  • Q4. Level order traversal of a tree using Queue
  • Ans. 

    Level order traversal of a tree using Queue

    • Create a queue and add the root node to it

    • While the queue is not empty, remove the front node and print its value

    • Add the left and right child nodes of the removed node to the queue

    • Repeat until the queue is empty

  • Answered by AI
  • Q5. Reverse level order traversal of a tree using Queue
  • Ans. 

    Reverse level order traversal of a tree using Queue

    • Create a queue and push the root node into it

    • While the queue is not empty, pop the front node and push its children into the queue

    • Add the popped node to a stack

    • Once the queue is empty, pop elements from the stack and print them

  • Answered by AI
  • Q6. BFS and DFS Difference
  • Ans. 

    BFS and DFS are graph traversal algorithms. BFS explores nodes level by level while DFS explores nodes depth by depth.

    • BFS uses a queue while DFS uses a stack or recursion.

    • BFS is optimal for finding shortest path while DFS is optimal for finding a path between two nodes.

    • BFS requires more memory as it stores all the nodes at each level while DFS requires less memory.

    • BFS can be used to find connected components while DFS

  • Answered by AI
  • Q7. OS Concepts – Starvation, Demand Paging, Virtual Memory, Deadlocks
  • Q8. Parenthesis Balance Checking
  • Q9. Three Jars - 1 with apples, 1 with oranges, 1 with apples and oranges. All of them wrongly labelled. Find min no of attempts to find the correct nature of boxes
  • Q10. Find product of each element of an array except that element in O(N) time complexity without using / operation
  • Ans. 

    Find product of each element of an array except that element in O(N) time complexity without using / operation

    • Use prefix and suffix products

    • Multiply prefix and suffix products for each element to get the final product

    • Handle edge cases where array has 0 or 1 element separately

  • Answered by AI
  • Q11. Recursively deleting linked list
  • Ans. 

    Recursively delete a linked list

    • Create a recursive function that takes the head of the linked list as input

    • Base case: if the head is null, return

    • Recursively call the function with the next node as input

    • Delete the current node

  • Answered by AI
  • Q12. Recursively deleting linked list from end
  • Ans. 

    Recursively delete a linked list from the end.

    • Start from the head and recursively traverse to the end of the list.

    • Delete the last node and set the second last node's next pointer to null.

    • Repeat until the entire list is deleted.

    • Use a recursive function to implement the deletion process.

  • Answered by AI
  • Q13. Recursively deleting tree
  • Ans. 

    Recursively delete a tree by deleting all its child nodes and then the parent node.

    • Start from the leaf nodes and delete them first.

    • Then move up to the parent nodes and delete them.

    • Repeat until the root node is deleted.

    • Use post-order traversal to ensure child nodes are deleted before parent nodes.

  • Answered by AI
  • Q14. Recursively deleting from end
  • Ans. 

    Recursively delete elements from the end of an array.

    • Create a recursive function that removes the last element of the array.

    • Call the function recursively until the desired number of elements are removed.

    • Handle edge cases such as empty arrays and removing more elements than the array contains.

  • Answered by AI
  • Q15. Difference between Floyd Warshall and Djikstra
  • Ans. 

    Floyd Warshall finds shortest path between all pairs of vertices while Djikstra finds shortest path from a single source.

    • Floyd Warshall is used for dense graphs while Djikstra is used for sparse graphs.

    • Floyd Warshall has a time complexity of O(n^3) while Djikstra has a time complexity of O((n+m)logn).

    • Floyd Warshall can handle negative edge weights while Djikstra cannot.

    • Floyd Warshall can detect negative cycles while Dj

  • Answered by AI
  • Q16. Shortest path between 2 points in 2-D space in O(log N) time
  • Ans. 

    There is no known algorithm to find shortest path in 2-D space in O(log N) time.

    • The best known algorithm for finding shortest path in 2-D space is Dijkstra's algorithm which has a time complexity of O(N^2).

    • Other algorithms like A* and Bellman-Ford have better time complexity but still not O(log N).

    • If the points are on a grid, Lee algorithm can be used which has a time complexity of O(N).

  • Answered by AI
  • Q17. Design a system for putting newspapers using classes and functions taking different aspects into account
  • Ans. 

    Design a system for putting newspapers using classes and functions

    • Create a Newspaper class with attributes like title, date, and content

    • Create a Publisher class with methods to publish and distribute newspapers

    • Create a Subscriber class with methods to subscribe and receive newspapers

    • Use inheritance to create different types of newspapers like daily, weekly, etc.

    • Implement a database to store newspaper information and ha

  • Answered by AI
  • Q18. SQL commands
  • Q19. Career Prospects - Long Term Plans
  • Q20. Why not higher studies?
  • Ans. 

    I believe practical experience is more valuable than higher studies.

    • I have gained valuable experience through internships and projects.

    • I prefer hands-on learning and problem-solving over theoretical knowledge.

    • I am constantly learning and improving my skills through online courses and workshops.

  • Answered by AI
  • Q21. Machine Learning Concepts - Based on my projects

Interview Preparation Tips

Round: Test
Experience: All Computer Science Topics Covered: Data Structures, Algorithms, Object Oriented Systems, C, C++, Operating Systems, Computer Architectures, Databases, SQL, Basic Quantitative Aptitude
Tips: Solve all of them. Cut off's generally go high.
Duration: 30 minutes
Total Questions: 30

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly.
Tips: Do not fake yourself.

General Tips: Be thorough with all CS related concepts and projects.
Skill Tips: ""Be thorough.""
Skills: Algorithms, Data Structures, Operating Systems, Machine Learning, SQL, Operating Systems, Computer Architecture, Data Analytics
College Name: IIT Kharagpur
Motivation: Kind of application oriented work and the rising nature of the company. Obviously money also.
Funny Moments: Many funny questions and answers like did you have lunch, when did you last eat, etc

Skills evaluated in this interview

Interview Preparation Tips

Round: Resume Shortlist
Experience: I had sent my resume to the hiring group, Selection through telephonic interviews. I was interviewed by three different research groups  (once by each).
Tips: Factors in decreasing order of importance: CGPA each stage. Ability to explain your projects precisely. Ability to solve ''standard" logarithmic problems.  The way you think and put down your Answer is the most important. The final answer .s not so I important, and they prod you when you think out aloud anyway.

Round: Technical Interview
Experience: Almost- by default they ask about your previous projects/internships if they are relevant to the group. Ofher questions depend on the group you are interviewed by and your own profile, In my case it was machine learning, text mining etc. I was told about the research problem they were dealing with then and asked f or comments/suggestions/.inputs and a discussion followed.
Tips: Basically these are specialized Interviews so it's good to have sound knowledge of your domain (analytical and application skills are very much required).

Skill Tips: CGPA>9.0, 1f not (like me) relevant work done in the domain and in past internship.A recommendation from the professor is also a good add on.
College Name: IIT Madras

Interview Preparation Tips

Round: Test
Experience: There was an apititude test basically in line with CAT pattern. It was conducted online for about 45 min duration. The questions were rather simple but each question was time bound (around 45 sec or so).
Tips: As such I did not have any structured study plan. I did refresh some of my basics in mechanics and analysis. I was more inclined to get a job in aerospace division. Read as per your interest.
Duration: 45 minutes

Round: Group Discussion
Experience: Initially, we are seated randomly in a circular manner and each one was given two minutes to describe the topic. It was followed by an tense debate where participants converged and diverged on different sets of issue. They were particularly looking for interpersonal skills and out of the box thinking.

Round: Interview
Experience: The interview was purely management type.More questions were thrown at team building, bio-data, why this company? , project, what you Can contribute for the firm?, where you see yourself in next 5 -10 years, ambitions, some amount of optimization tools and techniques, concluding remarks....Interpersonal skills and clarity in answering where mainly
IBM was a more relaxed interview, which basically dealt with management and interpersonal skills. Questions like “if one of our team mate is very stubborn, lazy, adamant, how will you tackle the situation” were asked.
Tips: College (B Tech) curricular activities, NTSC certificate, Math Olympiad certificate, all India quiz competition awards were noted and appreciated. That really was a booster. That helps in implanting an idea that you are not just blah blah blah.

Skill Tips: Be very sure about your mechanics, analysis and design. These three are the fundamentals.
I haven prepared for placements exclusively. Here were combined discussions. However, it really helps if you can revise and make your fundamentals were clear. The basic understanding should be there. An hour every day for two months will do the trick.
Be really choosy of the company you want to be in. Learn a lot more of the company and get an idea of what they are actually looking for. But still don’t freeze your mind to those realms alone.. Be open minded and cheerful. The first few questions will set the mood of the interview. If you are bale to crack that, then things will be really smooth. Really concentrate on your fundamentals, especially analysis and design.
Skills: Mechanics, Analysis , Design
College Name: IIT-Madras

Interview Preparation Tips

Round: Resume Shortlist
Experience: CGPA above 8

Round: Test
Experience: These involve questions from aptitude.
Tips: R S Agarwal's book on aptitude is enough for preparation.
Duration: 80 minutes

Round: Group Discussion
Experience: 11 members were part of the GD. The GD was not a rejection round.
Duration: 20 minutes

Round: HR Interview
Experience: Basic Questions.
Tips: Just prepare normal questions for HR.

General Tips: Prepare from placement material from LAN.
Prepare basic fundaes.
College Name: IIT MADRAS
Contribute & help others!
anonymous
You can choose to be anonymous

Adobe Interview FAQs

How many rounds are there in Adobe Software Engineer interview?
Adobe interview process usually has 1-2 rounds. The most common rounds in the Adobe interview process are Coding Test and One-on-one Round.
How to prepare for Adobe Software Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Adobe. The most common topics and skills that interviewers at Adobe expect are Java, AWS, C++, ETL and Python.
What are the top questions asked in Adobe Software Engineer interview?

Some of the top questions asked at the Adobe Software Engineer interview -

  1. given sudoku as id array of size . in a given empty cell find the possible numb...read more
  2. In an Array of size 95 contain numbers in range 1 to 100. each number is at max...read more
  3. given 4 unsigned integers find their integer average (eg. (2,2,2,3) => (2+2+2+3...read more

Recently Viewed

INTERVIEWS

Meesho

No Interviews

INTERVIEWS

Biocon Biologics

No Interviews

INTERVIEWS

Cult.fit

No Interviews

INTERVIEWS

Tredence

No Interviews

INTERVIEWS

Drishtee

No Interviews

INTERVIEWS

Genstru Consultants

No Interviews

INTERVIEWS

Axis Bank

No Interviews

INTERVIEWS

Texas

No Interviews

INTERVIEWS

Texas

No Interviews

INTERVIEWS

Strand Life Sciences

No Interviews

Tell us how to improve this page.

Adobe Software Engineer Interview Process

based on 3 interviews

1 Interview rounds

  • Technical Round
View more
Adobe Software Engineer Salary
based on 254 salaries
Lock Unlock
₹7.5 L/yr - ₹28 L/yr
117% more than the average Software Engineer Salary in India
View more details

Adobe Software Engineer Reviews and Ratings

based on 37 reviews

4.2/5

Rating in categories

3.9

Skill development

4.0

Work-life balance

3.9

Salary

4.5

Job security

4.5

Company culture

3.6

Promotions

3.7

Work satisfaction

Explore 37 Reviews and Ratings
Computer Scientist
441 salaries
unlock blur Lock Unlock

₹0 L/yr - ₹0 L/yr

Technical Consultant
278 salaries
unlock blur Lock Unlock

₹0 L/yr - ₹0 L/yr

Software Engineer
254 salaries
unlock blur Lock Unlock

₹0 L/yr - ₹0 L/yr

Computer Scientist 2
231 salaries
unlock blur Lock Unlock

₹0 L/yr - ₹0 L/yr

Senior Technical Consultant
204 salaries
unlock blur Lock Unlock

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Adobe with

Salesforce

4.0
Compare

Oracle

3.7
Compare

Microsoft Corporation

4.0
Compare

Amazon

4.1
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent