Adobe Software Developer Intern Interview Questions, Process, and Tips for Freshers

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. 
Find the number with the maximum frequency in an array of integers.
• Iterate through the array and keep track of the frequency of each number using a hashmap.

• Find the number with the maximum frequency and return it.

• If multiple elements have the same maximum frequency, return the one that appears first in the array.
Answered by AI
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.
Ans. 
Design a parking lot system with features like ticketing, availability tracking, and payment options.
• Create a database to store information about parking spots, availability, and pricing

• Implement a ticketing system to assign and track parking spots for each vehicle

• Include sensors or cameras to monitor spot availability in real-time

• Offer payment options such as cash, credit card, or mobile payment apps
Answered by AI
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. 
Zigzag level order traversal of a binary tree alternates direction at each level, starting from left to right, then right to left.
• Use a queue to perform level order traversal of the binary tree.

• Maintain a flag to alternate the direction of traversal at each level.

• Store nodes at each level in separate arrays and reverse the array if traversal direction is right to left.
Answered by AI
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. 
Determine if a binary tree is symmetric by checking if its left and right subtrees are mirror images of each other.
• Check if the left and right subtrees of the root node are mirror images of each other

• Recursively check if the left subtree of the left child is a mirror image of the right subtree of the right child, and vice versa

• Base case: If both nodes are null, return true; If one node is null and the other is not, ret...read more
Answered by AI
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. 
Given a rotated sorted array, find the index of a given integer 'K'.
• Perform binary search to find the pivot point where the array is rotated.

• Based on the pivot point, apply binary search on the appropriate half of the array to find 'K'.

• Handle cases where 'K' is not present in the array by returning -1.
Answered by AI
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
Ans. 
Identify missing numbers within the range of smallest and largest elements in an array.
• Find the smallest and largest elements in the array.

• Generate a list of numbers within this range.

• Remove numbers that are present in the array.

• Sort and return the missing numbers.
Answered by AI
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
Ans. 
Determine if each number in the array has exactly 3 factors.
• Iterate through each number in the array and check if it has exactly 3 factors.

• Factors of a number can be found by iterating from 1 to the square root of the number.

• Count the number of factors and return 1 if it is exactly 3, else return 0.
Answered by AI
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
Ans. 
Find all possible paths for a rat in a maze to reach its destination.
• Implement a backtracking algorithm to explore all possible paths in the maze.

• Keep track of the current path and mark visited cells to avoid loops.

• Return the paths that lead from the start position to the destination.

• Example: [[1, 0, 0], [1, 1, 0], [0, 1, 1]]
Answered by AI
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
Ans. 
Santa needs to find the quickest path to deliver gifts in Ninja town by jumping over buildings with least travel time.
• Santa can jump to (x+1, y+1), (x+1, y), or (x, y+1) from any cell (x, y) within grid boundaries.

• The travel time between two buildings equals the absolute difference in their heights.

• Find the shortest path from (0, 0) to (N-1, M-1) using dynamic programming or Dijkstra's algorithm.

• Consider all possible p...read more
Answered by AI
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
Ans. 
Count distinct substrings of a given string using trie data structure.
• Implement a trie data structure to store all substrings of the given string.

• Count the number of nodes in the trie to get the distinct substrings count.

• Handle empty string case separately.

• Example: For 'ab', distinct substrings are: '', 'a', 'b', 'ab'.
Answered by AI
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. 
Zigzag level order traversal of a binary tree alternating direction at each level.
• Use a queue to perform level order traversal of the binary tree.

• Maintain a flag to alternate the direction of traversal at each level.

• Store nodes at each level in separate lists and reverse the list if traversal direction is right to left.
Answered by AI
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
Ans. 
Count the number of subarrays containing only 1s and 0s in a given array of 0s and 1s.
• Iterate through the array and count consecutive 1s and 0s separately.

• Use two variables to keep track of the count of 1s and 0s subarrays.

• Add the counts of 1s and 0s subarrays to get the final result.
Answered by AI
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

Q1. 
Search in a Row-wise and Column-wise Sorted Matrix Problem Statement
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...read more
Add your answer
Q2. 
Kevin and His Cards Problem Statement
Kevin has two packs of cards. The first pack contains N cards, and the second contains M cards. Each card has an integer written on it. Determine two results: the tot...read more
Add your answer
Q3. 
Tiling Problem Statement
Given a board with 2 rows and N columns, and an infinite supply of 2x1 tiles, determine the number of distinct ways to completely cover the board using these tiles.
You can place...read more
Add your answer
Q4. 
Chocolate Distribution Problem
You are given an array/list CHOCOLATES of size 'N', where each element represents the number of chocolates in a packet. Your task is to distribute these chocolates among 'M'...read more
Add your answer