Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
Adobe interview experience Real time questions & tips from candidates to crack your interview

Product Intern

Adobe
upvote
share-icon
2 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 2 months
Topics: Data Structures - Arrays, Strings, Stacks, Queues, Recursion, Hashmaps, Trees, Pointers,Dynamic Programming, Operating Systems - OS Kernel, Deadlock, Virtual Memory, Memory Management, Paging, Segmentation, Object Oriented Programming, Puzzles
Tip
Tip

Tip 1 :Confidence is the key to excel any interview. Practice more questions and build up your confidence level. 
Tip 2 :Understand the concepts first behind each algorithm and try to solve around 20-25 questions for each data structure. Practice the data structure portion and read few interview experiences questions
Tip 3 : In an interview, if you get stuck in any question, don't panic. Try to ask about the constraints and cases from the interviewer and extract hints from it. Interviewers usually help you to reach to a solution.

Application process
Where: Campus
Eligibility: No criteria
Resume Tip
Resume tip

Tip 1: Keep it short and crisp. Utilise one full page wisely to describe yourself. It should not be more than a page.
Tip 2: Focus on the Projects/Work Experience and Achievements Section.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration60 minutes
Interview date22 Nov 2018
Coding problem1

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

1. Colourful Knapsack Problem

Hard
45m average time
0/120
Asked in companies
AdobeSamsungGoogle

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] which is an integer between 1 to 'M', both inclusive.

You have been required to fill a Knapsack with these stones. The Knapsack can hold a total weight of 'X'.

You are required to select exactly 'M' stones; one of each color. The sum of the weights of the stones must not exceed 'X'. Since you paid a premium for a Knapsack with capacity 'X', you are required to fill the Knapsack as much as possible.

Write a program to calculate the best way to fill the Knapsack - that is, the unused capacity should be minimized.

Try solving now
02
Round
Easy
Telephonic
Duration60 mins
Interview date5 Dec 2018
Coding problem3

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

1. There are two singly linked lists in a system. By some programming error, the end node of one of the linked list got linked to the second list, forming an inverted Y shaped list. Write a program to get the point where two linked list merge.

Easy
25m average time
73% success
0/40
Asked in companies
MicrosoftAdobeApple

You are given two Singly Linked Lists of integers, which may have an intersection point.

Your task is to return the first intersection node. If there is no intersection, return NULL.


Example:-
The Linked Lists, where a1, a2, c1, c2, c3 is the first linked list and b1, b2, b3, c1, c2, c3 is the second linked list, merging at node c1.

alt.txt

Problem approach

Simple approach - Use 2 nested loops. The outer loop will be for each node of the 1st list and inner loop will be for 2nd list.
Optimised Approach -
Get count of the nodes in the first list, let count be c1.
Get count of the nodes in the second list, let count be c2.
Get the difference of counts d = abs(c1 – c2)
Now traverse the bigger list from the first node till d nodes so that from here onwards both the lists have equal no of nodes.
Then we can traverse both the lists in parallel till we come across a common node. (Note that getting a common node is done by comparing the address of the nodes)

Try solving now

2. Asked concepts like - Segmentation, Swapping using Virtual Memory, Kernel .

Problem approach

Tip 1:I had read the OS concepts from the book Galvin. 
Tip 2:Try to give real life examples after explaining the concepts.

3. Egg dropping puzzle

It was just discussed at the end.

Problem approach

Tip: Practice 15-20 puzzles from codezen and GFG
 

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

Suppose list1 is [2, 133, 12, 12], what is max(list1) in Python?

Choose another skill to practice
Start a Discussion
Similar interview experiences
company logo
Product Intern
2 rounds | 8 problems
Interviewed by Adobe
1797 views
0 comments
0 upvotes
company logo
Product Intern
2 rounds | 3 problems
Interviewed by Adobe
1170 views
0 comments
0 upvotes
company logo
Product Intern
2 rounds | 6 problems
Interviewed by Adobe
543 views
0 comments
0 upvotes
company logo
Product Intern
2 rounds | 4 problems
Interviewed by Adobe
33 views
0 comments
0 upvotes