Adobe interview experience Real time questions & tips from candidates to crack your interview

MTS 1

Adobe
upvote
share-icon
4 rounds | 7 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 months
Topics: Data structure, Algorithms, Operating system, System design, DBMS
Tip
Tip

Tip 1 : Solve DSA Maximum questions as you can
Tip 2 : Candidate should have basic knowledge on system design and OS
 

Application process
Where: Referral
Eligibility: Past Experience Required
Resume Tip
Resume tip

Tip 1 : Do not put unnecessary things which will make you in trouble.
Tip 2 : Practice what you preach

Interview rounds

01
Round
Medium
Video Call
Duration40 minutes
Interview date27 Sep 2022
Coding problem2

It was started in afternoon 2 PM. and started with my introduction and later he has asked me about my college final year project and I'm Electronics branch student and i obviously didn't make any project related to IT but my final year project was on Embedded and he was impressed on my roll in project seems like he was listening some new thing and after that about my past company project and he moved on coding question and asked me about recursion, string and pointer related question.

1. String Palindrome

Easy
0/40
Asked in companies
FlipkartUnacademyInfosys

Given a string, determine if it is a palindrome, considering only alphanumeric characters.

Palindrome
A palindrome is a word, number, phrase, or other sequences of characters which read the same backwards and forwards.
Example:
If the input string happens to be, "malayalam" then as we see that this word can be read the same as forward and backwards, it is said to be a valid palindrome.

The expected output for this example will print, 'true'.

From that being said, you are required to return a boolean value from the function that has been asked to implement.

Problem approach

A string is palindrome if it remains the same on reading from both ends. I've find the length of string and run loop and comparing character from first and last one by one.

Try solving now

2. 3Sum

Moderate
15m average time
85% success
0/80
Asked in companies
BarclaysMeeshoFreshworks

You are given an array/list ARR consisting of N integers. Your task is to find all the distinct triplets present in the array which adds up to a given number K.

An array is said to have a triplet {ARR[i], ARR[j], ARR[k]} with sum = 'K' if there exists three indices i, j and k such that i!=j, j!=k and i!=j and ARR[i] + ARR[j] + ARR[k] = 'K'.

Note:
1. You can return the list of values in any order. For example, if a valid triplet is {1, 2, -3}, then {2, -3, 1}, {-3, 2, 1} etc is also valid triplet. Also, the ordering of different triplets can be random i.e if there are more than one valid triplets, you can return them in any order.
2. The elements in the array need not be distinct.
3. If no such triplet is present in the array, then return an empty list, and the output printed for such a test case will be "-1".
Try solving now
02
Round
Easy
Video Call
Duration45 minutes
Interview date29 Sep 2022
Coding problem3

It was started at 10 AM and completed at 10:45 AM around, in between it was completely DSA algorithm and I noticed one thing in 2nd round interview that, according to interviewer perspective, if candidate has less knowledge on past project that was okay for him but candidate should must have DSA knowledge and based on that he was judging skill. and he asked me 4 program about tree and Hashmap related question and i couldn't able to solve 2 of them and it was bit difficult for me

1. Is Height Balanced Binary Tree

Moderate
15m average time
85% success
0/80
Asked in companies
Paytm (One97 Communications Limited)AmazonAdobe

You are given the root node of a binary tree.


Return 'true' if it is a height balanced binary tree.


Note:
Height of a tree is the maximum number of nodes in a path from the node to the leaf node.

An empty tree is a height-balanced tree. A non-empty binary tree is a height-balanced binary tree if
1. The left subtree of a binary tree is already the height-balanced tree.
2. The right subtree of a binary tree is also the height-balanced tree.
3. The difference between heights of left subtree and right subtree must not more than ‘1’.


Example:

Input: Consider the binary tree given below:

alt text

Output: 'true'

Explanation:
Consider subtree at Node ( 7 ) 
Left subtree height is ‘0’ and right subtree height is ‘0’, the absolute height difference is ‘0-0 = 0’ and ‘0’ is not more than ‘1’ so subtree at Node ( 7 ) is a height-balanced binary tree. 
Same for subtrees at Nodes ( 5, 6 ). 

Consider subtree at Node ( 4 ) 
Left subtree height is ‘1’ and right subtree height is ‘0’, the absolute height difference is ‘1-0 = 1’ and ‘1’ is not more than ‘1’ so subtree at Node ( 4 ) is a height-balanced binary tree.
Same for subtree at Node ( 3)

Consider subtree at Node ( 2 ) 
Left subtree height is ‘2’ and right subtree height is ‘1’, the absolute height difference is ‘2-1 = 1’ and ‘1’ is not more than ‘1’ so subtree at Node ( 2 ) is a height-balanced binary tree.

Consider subtree at Node ( 1 ) 
Left subtree height is ‘3’ and right subtree height is ‘2’, the absolute height difference is ‘3-2 = 1’ and ‘1’ is not more than ‘1’ so subtree at Node ( 1 ) is a height-balanced binary tree.

Because the root node ( 1 ) is a height-balanced binary tree, so the complete tree is height-balanced.


Problem approach

Find height of left and right subtrees using dfs traversal. Print true if the difference between heights is not more than 1 and left and right subtrees are balanced, otherwise print false.

Try solving now

2. Find The Sum Of The Left Leaves

Moderate
25m average time
75% success
0/80
Asked in companies
OYOAdobeMakeMyTrip

Given a binary tree with ‘root’. Your task is to find the sum of all the left leaf nodes.

Properties of leaf:-

In a binary tree, a leaf is a node such that it does not have any children. Node ‘1’ is always the root of the binary tree. Left leaves are those nodes that are the left child of their parent and a leaf node.

Example:
Let’s say you have a binary tree as follows:-

subsequence

Node 4 and Node 5 are leaf nodes and left child of their parent. Node 6 is a leaf node but not the left child of its parent node 3. Therefore return ‘4+5= 9’ as the answer.

Note:
You do not need to print anything; it has already been taken care of. Just implement the function.
Problem approach

first to traverse the tree, starting from root till every node, check if its left subtree is a leaf. If it is, then add it to the result.

Try solving now

3. Most Frequent Word

Easy
15m average time
85% success
0/40
Asked in companies
AtlassianAmazonHackerEarth

You are given two strings 'A' and 'B' of words. Your task is to find out the most frequent and lexicographically smallest word in string 'A', which is not present in string 'B'. If no such word is present in 'A', then return -1.

Note:

1. A word is a sequence of one or more lowercase characters.

2. Words are separated by a single whitespace character.
Example:
For the given string 'A' = “coding ninjas coding ninjas” and 'B' = “data structures and algorithms”, so both the word 'coding' and 'ninjas' are not present in string 'B' and occur two times each, but the word “coding” is lexicographically smaller than the word “ninjas”. So the answer is “coding”.
Try solving now
03
Round
Medium
Video Call
Duration30 minutes
Interview date30 Sep 2022
Coding problem1

It was 30 minute interview, started at 11 AM. and interviewer asked me less question of DSA and more on system design.

1. Cycle Detection in a Singly Linked List

Moderate
15m average time
80% success
0/80
Asked in companies
ThalesCIS - Cyber InfrastructureUrban Company (UrbanClap)

You are given a Singly Linked List of integers. Return true if it has a cycle, else return false.


A cycle occurs when a node's next points back to a previous node in the list.


Example:
In the given linked list, there is a cycle, hence we return true.

Sample Example 1

Try solving now
04
Round
Easy
Video Call
Duration20 minutes
Interview date30 Sep 2022
Coding problem1

HR Round

1. Basic HR Questions

Tell me about yourself.

Why do you want to join us?

Where do you see yourself in 5-10 years?

Here's your problem of the day

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

Skill covered: Programming

Which array operation has O(n) worst-case time complexity?

Choose another skill to practice
Similar interview experiences
company logo
MTS 1
6 rounds | 10 problems
Interviewed by Adobe
3678 views
1 comments
0 upvotes
company logo
MTS 1
2 rounds | 5 problems
Interviewed by Adobe
1274 views
1 comments
0 upvotes
company logo
MTS 1
3 rounds | 6 problems
Interviewed by Adobe
1106 views
0 comments
0 upvotes
company logo
MTS 1
2 rounds | 6 problems
Interviewed by Adobe
368 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
MTS 1
4 rounds | 14 problems
Interviewed by Oracle
3087 views
0 comments
0 upvotes