Adobe Interview Experience | Sep 2022 (Exp. 0-2 Years)

New update is available. Click here to update.

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

MTS 1

Adobe

4 rounds | 7 Coding problems

Anonymous

Experienced | Sep 2022

Rejected

Interview preparation journey

Preparation

Duration: 3 months

Topics: Data structure, Algorithms, Operating system, System design, DBMS

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

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

Interview rounds

Round

Medium

Video Call

Duration40 minutes

Interview date27 Sep 2022

Problems2

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

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 c...

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

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.

Try solving now

Round

Easy

Video Call

Duration45 minutes

Interview date29 Sep 2022

Problems3

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

You are given the root node of a binary tree.

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

Note:

Height...

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