Adobe Product Intern Interview Questions, Process, and Tips

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 Non-Adjacent Subsequence Sum
Given an array of integers, determine the maximum sum of a subsequence without choosing adjacent elements in the original array.
Input:
The first line consists of an...read more
Ans. 
Find the maximum sum of a subsequence without choosing adjacent elements in the original array.
• Iterate through the array and keep track of the maximum sum of non-adjacent elements.

• At each index, compare the sum of including the current element with excluding the current element.

• Return the maximum sum obtained.

• Example: For input [3, 2, 7, 10], the maximum sum is 13 by selecting 3 and 10.

• Example: For input [3, 2, 5], the
Answered by AI
Add your answer

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. 
Power Calculation Problem Statement
Given a number x and an exponent n, compute xn. Accept x and n as input from the user, and display the result.
Note:
You can assume that 00 = 1.
Input:
Two integers...read more
Ans. 
Calculate x raised to the power of n, given x and n as input from the user.
• Accept two integers x and n as input from the user

• Compute x^n and display the result

• Handle the case where x=0 and n=0 separately (0^0 = 1)
Answered by AI
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 Array by Set Bit Count
Given an array of positive integers, your task is to sort the array in decreasing order based on the count of set bits in the binary representation of each integer.
If two num...read more
Ans. 
Sort the array in decreasing order based on the count of set bits in the binary representation of each integer.
• Iterate through the array and calculate the set bit count for each integer using bitwise operations.

• Use a custom comparator function to sort the array based on the set bit count.

• Maintain the original order for integers with the same set bit count.

• Modify the array in-place within the given function.
Answered by AI
Add your answer
Q2. 
Minimum Number of Lamps Needed
Given a string S containing dots (.) and asterisks (*), where a dot represents free spaces and an asterisk represents lamps, determine the minimum number of additional lamps...read more
Ans. 
Determine the minimum number of additional lamps needed to illuminate a string with dots and asterisks.
• Iterate through the string and check for free spaces that are not already illuminated by existing lamps

• Place a lamp at each free space that is not already illuminated by an existing lamp

• Consider edge cases where the first and last positions may need additional lamps
Answered by AI
Add your answer
Q3. Technical Article
A situation is given, we have to write a technical article of around 300-500 words (I dont remember exact word limit)
Ans. 
How to optimize website performance for better user experience
• Implementing lazy loading for images and videos

• Minifying CSS and JavaScript files

• Utilizing browser caching for static assets

• Reducing server response time by optimizing code and database queries
Answered by AI
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 Problem Statement
Given a binary tree with N nodes, determine whether the tree is a Binary Search Tree (BST). If it is a BST, return true; otherwise, return false.
A binary search tree (BST)...read more
Ans. 
Validate if a binary tree is a Binary Search Tree (BST) based on given properties.
• Check if left subtree contains only nodes with data less than current node's data

• Check if right subtree contains only nodes with data greater than current node's data

• Recursively check if both left and right subtrees are also BSTs
Answered by AI
Add your answer
Q2. 
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...read more
Ans. 
Reverse a singly linked list of integers and return the head of the reversed linked list.
• Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

• Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.

• Ensure to update the head of the reversed linked list at the end of the process.

• Example: Input: 1 -> 2 -> 3 -...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Timing - Test Link is active for 5 days. It can be taken anytime between that window.
It was conducted on Hackerrank.
Duration - 60 mins
Try to quickly solve the coding question first in around 20 mins and give rest of the time to MCQs. MCQs were of medium level.
Practice the MCQs from codezen. 7-8 questions were similar to those on codezen

Q1. 
Colourful Knapsack Problem Statement
You are given N stones labeled from 1 to N. The i-th stone has the weight W[i]. There are M colors labeled by integers from 1 to M. The i-th stone has the color C[i] w...read more
Ans. 
The task is to fill a Knapsack with stones of different colors and weights, minimizing unused capacity.
• Given N stones with weights W and colors C, choose M stones (one of each color) to fill Knapsack with total weight not exceeding X

• Minimize unused capacity of Knapsack by choosing stones wisely

• If no way to fill Knapsack, output -1

• Example: N=5, M=3, X=10, W=[1, 3, 3, 5, 5], C=[1, 2, 3, 1, 2] -> Output: 1
Answered by AI
Add your answer

Round duration - 60 mins
Round difficulty - Easy

Timing - 60 mins
Environment - Google Docs shared
The interviewer from Adobe was interactive and helpful throughout the round.

Q1. 
Linked List Merge Point Problem
You are given two singly linked lists and a third linked list, such that the two lists merge at some node of the third linked list. Determine the data value at the node whe...read more
Ans. 
Given two linked lists that merge at some point, find the data value at the merging node.
• Traverse both lists to find their lengths and the difference in lengths

• Move the pointer of the longer list by the difference in lengths

• Traverse both lists simultaneously until the nodes match to find the merging node
Answered by AI
Add your answer
Q2. Can you explain the Egg Dropping Puzzle and how it was discussed?
Add your answer