Adobe Software Developer Intern Interview Questions, Process, and Tips

Round duration - 90 Minutes
Round difficulty - Easy

It was a telephonic round. The interview asked me these questions.
 

Round duration - 60 Minutes
Round difficulty - Medium

The interviewer started asking me questions. He gave me 2 problems. He was giving hints in case of any issues.
 

Q1. 
Maximum Frequency Number Problem Statement
Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.
If multip...read more
Ans. Brute Force Approach
Here, we can simply run two loops. The outer loop picks all elements one by one and the inner loop finds the frequency of the picked element and compares it with the maximum present so far.
 
Algorithm:
 
• Declare 4 variables as ‘maxFrequency’ , ‘currentFrequency’ , ‘maxElement’ , ‘currentElement’ and initialize them with 0
• Run a loop from ‘i’ = ‘0’ to ‘N’
  • Set ‘currentElement’ as arr[i] and ‘curr...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This was a technical interview. He gave me these questions one by one.
1. Again, how polymorphism works. Draw vtable and vptr
2. Producer consumer problem with synchronization
3. Difference between mutex, semaphore, and condition_variable.
4. Design parking lot system
5. Zigzag traversal of binary tree

Q1. Design a parking lot system.
Add your answer
Q2. 
Zigzag Binary Tree Traversal Problem Statement
Determine the zigzag level order traversal of a given binary tree's nodes. Zigzag traversal alternates the direction at each level, starting from left to rig...read more
Ans. Iterative Approach
Our very basic intuition is that we are going to traverse the given binary tree using level order traversal where we just need to modify one thing that for every alternate level we need to reverse the order that level. 
 
Steps are as follows:
 
1. Create an empty queue.
2. For each node, first, the node is visited and then it’s child nodes are added in the queue if they exist(First in first out).
3. ...read more
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

1. He asked about the producer-consumer problem but I told him that the same question is asked in the previous round.
Then interviewer went asking lots of questions related to producer and consumer. Lots of discussions like what is a writer is not there and the only reader is there and you need to find out how many readers are currently reading from the buffer.
2. Discussions about C++11 features. How thread and async is different
3. Design your own shared_ptr(How you will handle ownership)
4. Check If the binary tree is symmetrical.
5. Find elements in a rotated sorted array and then optimize it.

Q1. 
Tree Symmetricity Problem Statement
You are provided with a binary tree structure, where each node consists of an integer value. Your task is to determine whether this binary tree is symmetric.
A symmetr...read more
Ans. Inorder And Reverse Inorder
We do two inorder traversals recursively of the tree simultaneously. For the first traversal, we traverse the left child first and then the right child, and in the second traversal, we traverse the right child first and then the left child. Let cur1 and cur2 be the current nodes of the first and second traversals respectively and initially both of them are passed as root. Then the algorithm f...read more
Answered Anonymously
Add your answer
Q2. 
Search In Rotated Sorted Array Problem Statement
Given a rotated sorted array ARR of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.
Note:
1. If 'K' is not present...read more
Ans. Naive Approach
Naively traverse the array and find if ‘K’ is present in ARR or not. If ‘K’ is present in ARR return its index else return -1.
Space Complexity: O(1)Explanation:
O(1), i.e. constant space complexity. 
Time Complexity: O(n)Explanation:
O(N), where N is the length of the array/list. 
 
We are iterating over the array/list ARR once. Hence, the time complexity is O(N).

Java (SE 1.8)

/*

    Time Compl...read more
Answered Anonymously
Add your answer

Round duration - 123 minutes
Round difficulty - Medium

This was an online assessment round that consisted of 4 sections:

1) Cognitive Assessment (20 questions- 20 minutes): It had 2 sections.

English: (10 questions), which composed of comprehension-based and basic grammar questions,
Numerical Ability: (10 questions), which composed of questions on geometry, trigonometry, quadratic equations, probability, statistics, etc.

2) Technical Assessment (20 questions-20 minutes): It consisted of MCQs on Data Structures & Algorithms, DBMS, OOPs, OS, and Computer Networks.

3) Coding Assessment (2 questions- 60 minutes) The 2 questions were:

Similar to this -----/
Similar to this -----/

4) Gamified Assessment (3 tasks- 23 minutes): This section composed of mind game-based questions that had to be done according to the given instructions.

Q1. 
Digit Count In Range Problem Statement
Given an integer K, and two numbers A and B, count the occurrences of the digit K in the range [A, B].
Include both the lower and upper limits in the count.
Input:
...read more
Ans. 
I solved this question using the brute force approach.
Answered Anonymously
Add your answer
Q2. 
Wildcard Pattern Matching Problem Statement
Implement a wildcard pattern matching algorithm to determine if a given wildcard pattern matches a text string completely.
The wildcard pattern may include the...read more
Ans. 
I solved this question using the dynamic programming approach.
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The interview was scheduled for 9 Jan 21 from 6:00 pm. The interviewer started with “Tell me about yourself”. Then he asked some CS fundamental questions. I was asked about the singleton class and then about the memory layout in C++, then he moved on to the next question. He pasted a code snippet in the chatbox and asked me to tell the output. I copied the code to my local editor and explained my approach to finding the output. The code was related to the concept of virtual function and destructor in C++. After that, he asked me how much memory will be used by a struct that is storing 2 char variables and 1 int variable.

After that, he started with questions on data structures and algorithms and I was asked three questions.

Q1. 
Print Binary Tree Representation
Given a binary tree of integers, your task is to represent the binary tree in a 2-D array of strings with specific formatting rules.
Specifications:
• There should be ‘...read more
Ans. 
Step 1 : The first approach that I gave was to find the height of the binary tree and then traverse the binary tree in level order and print the nodes at half the height of the tree. This approach required 2 traversals, but the interviewer wanted an approach with just one traversal.
Step 2 : The second approach that I gave was to traverse the binary tree in level order and store the nodes level-wise in a vector. Store t...read more
Answered Anonymously
Add your answer
Q2. 
Unbounded Knapsack Problem Statement
Given ‘N’ items, each with a specific profit and weight, and a knapsack with a weight capacity ‘W’. The objective is to fill the knapsack such that the total profit is...read more
Ans. 
Step 1 : I gave the most optimized approach using Dynamic Programming. 
I shouldn't have done that. You should always start with the brute force approach and then optimize that.
Answered Anonymously
Add your answer
Q3. 
Minimum Cost to Make String Valid
Given a string containing only '{' and '}', determine the minimum cost required to make the string valid. A string is considered valid if for every opening bracket '{', t...read more
Ans. 
Step 1 : I gave the most optimized approach with O(n) time complexity. 
I shouldn't have done that. You should always start with the brute force approach and then optimize that.
Answered Anonymously
Add your answer

Round duration - 70 minutes
Round difficulty - Easy

Timing : 11:00 am
Webcam was mandatory.

Q1. 
Missing Numbers Problem Statement
You are provided with an array called ARR, consisting of distinct positive integers. Your task is to identify all the numbers that fall within the range of the smallest a...read more
Add your answer
Q2. 
Prime with 3 Factors Problem Statement
You are provided with an array ARR consisting of 'N' positive integers. Your task is to determine if each number in the array ARR has exactly 3 factors.
You need to...read more
Add your answer

Round duration - 108 minutes
Round difficulty - Medium

Timing : 10:00 am
Webcam was mandatory

Q1. 
Rat In a Maze Problem Statement
Given a N * N maze with a rat placed at position MAZE[0][0], find and print all possible paths for the rat to reach its destination at MAZE[N-1][N-1]. The rat is allowed to...read more
Add your answer
Q2. 
Min Jumps Problem Statement
In Ninja town, represented as an N * M grid, people travel by jumping over buildings in the grid's cells. Santa is starting at cell (0, 0) and must deliver gifts to cell (N-1, ...read more
Add your answer

Round duration - 70 minutes
Round difficulty - Medium

Timing : 5 pm
Camera and mic was mandatory.
The interviewer was really nice and adjustable.

Q1. 
Count Distinct Substrings
You are provided with a string S. Your task is to determine and return the number of distinct substrings, including the empty substring, of this given string. Implement the solut...read more
Add your answer
Q2. 
Zigzag Binary Tree Traversal Problem Statement
Determine the zigzag level order traversal of a given binary tree's nodes. Zigzag traversal alternates the direction at each level, starting from left to rig...read more
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

It was in the evening. This round consists of 20 MCQs which covers portions from Data Structures, Aptitude, Coding based, etc. There is no negative marking for wrong answers

Q1. 
Count Subarrays Problem
You are given an array or list consisting of 0s and 1s only. Your task is to find the sum of the number of subarrays that contain only 1s and the number of subarrays that contain o...read more
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

It was in the morning. There is video call with the faculty of the company which interviews. Questions comes from my projects, skills, college studies

Round duration - 50 minutes
Round difficulty - Hard

My Interview for Adobe was on 16 September, 2019 . And my interview was telephonic interview and timing was about 12:00PM. And I got a call at about 12:15 PM .

Q1. 
K-Sum Path in a Binary Tree Problem Statement
You are presented with a binary tree where each node holds an integer, along with a specified number 'K'. The task is to identify and print every path that ex...read more
Ans. 
Step 1 : The interviewer gave me an example and describe me the question statement.
Step 2 : I told him my approach. I have done a similar question from gfg.
Step 3 : Then he ask me to write code.
Step 4 : I write the code and calculated complexity for the same.
Step 5 : He approved my Code and was happy form my approach.
Answered Anonymously
Add your answer
Q2. What is heap sort and what is its complexity?
Ans. 
Study all the sorting algorithms, their worst and best case time complexity and what are the test cases at which best and worst time complexity occurs. 
Answered Anonymously
Add your answer