Adobe Interview Experience by Janvi Singla

New update is available. Click here to update.

SDE - Intern

Adobe

3 rounds | 6 Coding problems

Janvi Singla

Fresher | Oct 2020

Selected

754 views

0 comments

4 upvotes

Interview preparation journey

Preparation

Duration: 7-8 months

Topics: Data Structures , Operating System, OOPS ,JAVA, projects , Memory allocation in C

Tip

Tip 1 : You should have in depth knowledge of your projects. Sometimes Adobe spend a whole interview in project discussion (in some cases).
Tip 2 : OOPS is a very important subject if you are preparing for Adobe. Also one should know real life examples of it and should be able to code any concept of it.
Tip 3 : One should have good knowledge of data structures. Mainly Array, Math, Tree, Recursion and LinkedList.
Tip 4 : According to me , projects just play role if you applying off campus and that too for the shortlisting of your resume as it gives you an edge in respect to other candidates. So if you are applying off campus you should have atleast 2-3 good projects in you resume.

Application process

Where: Campus

Eligibility: 70% in UG, 60% in 12th and 10th

Resume tip

Tip 1 : One should have good projects.
Tip 2 : The presentation of your resume should be really good. Bold keywords like tech stack you used or the topics you are really good at.

Interview rounds

Round

Easy

Online Coding Interview

Duration70 minutes

Interview date19 Oct 2020

Problems2

Missing Numbers

You are given an array 'ARR' of distinct positive integers. You need to find all numbers that are in the range of the elements of the array, but not in the array. The mis...

Problem approach

I just run a loop from 1 till N

Try solving now

Prime with 3 factors

You are given an array ‘ARR’ consisting of ‘N’ positive integers. Your task is to find if the number has exactly 3 factors for each number in the array ‘ARR’.

Problem approach

Step 1 : While n is divisible by 2, print 2 and divide n by 2.
Step 2 : After step 1, n must be odd. Now start a loop from i = 3 to square root of n. While i divides n, print i and divide n by i. After i fails to divide n, increment i by 2 and continue.
Step 3 : If n is a prime number and is greater than 2, then n will not become 1 by above two steps. So print n if it is greater tha...

Try solving now

Round

Medium

Online Coding Interview

Duration108 minutes

Interview date30 Oct 2020

Problems2

Rat In a Maze All Paths

You are given a 'N' * 'N' maze with a rat placed at 'MAZE[0][0]'. Find and print all paths that rat can follow to reach its destination i.e. 'MAZE['N' - 1][...

Problem approach

I wrote a solution using Dynamic Programming.
Step 1 : initialize a 2 D matrix and assign a meaning to value (here in our case , possible paths from given point to bottom right corner)
Step 2 : I initialized the matrix using base cases (if one column or one row)
Step 3 : filled the matrix accordingly.

Try solving now

Min jumps

Problem approach

I used Dynamic programing.
Step 1 : initialized a 1-D array
Step 2 : initialized last index value to zero.
Step 3 : calculated minimum steps from n-2 index to n-1 index and till index = 0

Try solving now

Round

Medium

Video Call

Duration70 minutes

Interview date17 Dec 2020

Problems2

Count distinct substrings

Given a string 'S', you are supposed to return the number of distinct substrings(including empty substring) of the given string. You should implement the program using a trie.

Note :

Problem approach

Step 1 : I used something similar to sliding window algorithm
Step 2 : I called a function which contains starting index of the string , an empty StringBuilder as it is mutable and an Arraylist to store indexes of all valid substrings as parameters.
Step 3 : declared a base case which states that the whole string is traversed.
Step 4 : declared some conditions,
(a) if the output Str...

Try solving now

Zigzag Binary Tree Traversal

Given a binary tree, return the zigzag level order traversal of the nodes' values of the given tree. Zigzag traversal means starting from ...

Problem approach

I kept an counter to calculate the level and and performed level order traversal and applied a condition that if the level was odd I added the elements into the list in reverse order fashion.

Try solving now