Adobe Product Intern Interview Questions, Process, and Tips for Freshers

2 medium-hard leetcode problem

Q1. 1. Binary tree traversal 2. Multiply 2 big numbers represented in the form of string. 3. Detect the k-th node from the back of a linked list.
Ans. 
Questions on binary tree traversal, multiplying big numbers represented as strings, and detecting k-th node from the back of a linked list.
• Binary tree traversal can be done in three ways: in-order, pre-order, and post-order.

• To multiply two big numbers represented as strings, you can use the grade-school algorithm or Karatsuba algorithm.

• To detect the k-th node from the back of a linked list, you can use two pointers app
Answered by AI
Add your answer

Round duration - 138 minutes
Round difficulty - Easy

Webcam and microphone were mandatory .
There was 16 mcqs (45 min),2 coding questions(60 min),1 essay writing(10 min) and gamified assessment(23 min).

Q1. Maximum sum of non-adjacent elements
You are given an array/list of ‘N’ integers. You are supposed to return the maximum sum of the subsequence with the constraint that no two elements are adjacent in the ...read more
Ans. Recursive Approach (top down)
We are going to explore all the possibilities of subsequences in which there will be no two elements that are adjacent to one another in the given array/list. So if we take the current element, let’s say ‘CURR’ then we are not allowed to take the element adjacent to ‘CURR’. So for that, we will call a recursive function one step forward to the ‘CURR’. 
 
The Steps are as follows:
&nb...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 60 minutes
Round difficulty - Medium

It was from 2 pm to 3pm. Interviewer was really friendly and provided me hints whenever I was stuck.

Q1. Find power of a number
Write a program to find x to the power n (i.e., x^n). Take x and n from the user. You need to print the answer.
Note: For this question, you can assume that 0 raised to the power o...read more
Ans. Using while() loop
Take input in two variable x and n. Create a variable ans and initialize it to 1
Run a while loop till n > 0. In each iteration mutilply your ans with x. Finally print ans.
Space Complexity: O(1)Explanation: Time Complexity: O(1)Explanation:
Answered by CodingNinjas
Add your answer
Q2. Puzzles
1. There are 100 doors in a row, all doors are initially closed. A person walks through all doors multiple times and toggle (if open then close, if close then open) them in following way: In first w...read more
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

It was an online round with coding questions, MCQs and a technical writing part

Q1. Sort an array according to count of set bits
You are given an array consisting of N positive integers, and your task is to sort the array in decreasing order of count of set bits in the binary representati...read more
Ans. Multimap
• Maintain a Multimap to store the pair of integer and its set bit count.
• The trick is to make (-1*count of set bits) as the key of the map because we have to sort the array on the basis of the count of set bits and it is multiplied by -1 because we have to sort it in descending order and by default the multimap store the integers in ascending order.
• Now traverse the map from the beginning and store all the element...read more
Answered by CodingNinjas
View 2 more answers
Q2. Minimum number of lamps needed to be installed
You are given a string 'S' containing dots(.) and asterisks(*) only, where the dot represents free spaces, and the asterisk denotes lamps. A lamp can...read more
Ans. Greedy algorithm
• The first thing to note is that for every three continuous dots, we will require one lamp. So if we have 'K' continuous dots, we will need exactly 'K'/3 lamps if 'K' is a multiple of 3. When 'K' is not a multiple of 3, we will require ceil('K' / 3) lamps because if we take the floor('K' / 3) there will be 1 or 2 extra spaces that will not be covered, for that we will require one extra lamp. Hence in tot...read more
Answered by CodingNinjas
Add your answer
Q3. MCQs
Matrices, determinants and polynomial equations MCQs are their
All of them are of engineering mathematics level
Add your answer
Q4. Technical Article
A situation is given, we have to write a technical article of around 300-500 words (I dont remember exact word limit)
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

It was an online telephonic round, I was aksed to share my screen and to open my code editor. I generally code in VS Code, So I shared my VS code screen with the interviewer.
Timing - 4pm
Environment was good
Interviewer was nice person

Q1. Validate BST
Given a binary tree with N number of nodes, check if that input tree is BST (Binary Search Tree) or not. If yes, return true, return false otherwise.
A binary search tree (BST) is a binary t...read more
Ans. 
I first explained that what is a BST.
Then Interviewer gave me an example and asked me to explain it and code it.
I was then started writing the code and explaining each line to the Interviewer that what I am doing.
Finally it was done and explained it further including all the corner cases
Answered by CodingNinjas
View 2 more answers
Q2. Reverse Linked List
Given a singly linked list of integers. Your task is to return the head of the reversed linked list.
For example:
The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then th...read more
Ans. 
I explained from scratch that what will be our algorithm and what all nodes I am gonna make and the purpose of each node.

Bonus Tip: Communicate with interviewer consistently, don't just keep quit all the time

Finally I solved it and interviewer was satisfied with my approach.
Answered by CodingNinjas
View 5 more answers
Q3. Writing classes of some data structures like linked list.
Add your answer
Q4. Infinite numbers are given, each number is either 0 or 1. Sort them.
Ans. 
I gave the solution using 2 pointer approach as it can solve it in linear time complexity.
I explained this question by giving an example and implementing my approach on that example.
interviewer was convinced.
Answered by CodingNinjas
View 1 more answer