Adobe interview experience Real time questions & tips from candidates to crack your interview
Support Engineer
Adobe
2 rounds | 4 Coding
problems
Rejected
Interview preparation journey
Preparation
Duration: 6 Months
Topics: Data Structures, Algorithms, OOPS, DBMS, OS
Tip 1 : Learn Data Structures and Algorithms.
Tip 2 : Practice coding question using coding platform like LeetCode or CodeChef.
Tip 3 : Focus more on time and space complexities and explore different ways to solve problem.
Application process
Where: Other
Eligibility: 7 CGPA, good in programming/DSA
Tip 1 : Highlight your past experience if you have, skills and working projects in your resume.
Tip 2 : Do not put false things and over skills in your resume.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 Minutes
Interview date2 Jun 2022
Coding problem2
Timing-90 minutes is the Duration Of Assessment
you need to give the test within 5 days of getting the test mail.
There are total 2 sections-
1st is containing some mcq type question and 2nd is containing coding questions.
Test is conducted virtually through TCS platform. Test covers DSA, OOPS concept, DBMS, SQL, Programming and some general question related to Leadership Principles and workstyles.
1. Technical Questions
We need to answer questions related to Core subjects, DBMS, SQL, OOPS concept, Programming, Behavioral, Leadership Principles and workstyles.
this round is entirely based on MCQ's.
Questions like:-
1) How to copy data from one server to another server in unix?
2) What is the output of below program
3)What is the output of the flow chart program.
4)which unix command that creates a file without contend
5)Choose the correct property of foreign key in SQL?
6)Which unix command is used to redirect the no of characters in a file f1 to a file f2
7)How to show only last 10 files of a folder in unix?
8)Which of these is DDL command?
9)how to change the file permission in unix?
Problem approach
Tip 1 : Need to select correct option out of 4 options(MCQ type questions)
Tip 2 : Revice your notes and practice more in required skill set of a job before giving the assessment.
Tip 3 : Select correct option based on your knowledge
2. Next Permutation
Moderate
15m average time
85% success
0/80
Asked in companies
You have been given a permutation of ‘N’ integers. A sequence of ‘N’ integers is called a permutation if it contains all integers from 1 to ‘N’ exactly once. Your task is to rearrange the numbers and generate the lexicographically next greater permutation.
To determine which of the two permutations is lexicographically smaller, we compare their first elements of both permutations. If they are equal — compare the second, and so on. If we have two permutations X and Y, then X is lexicographically smaller if X[i] < Y[i], where ‘i’ is the first index in which the permutations X and Y differ.
For example, [2, 1, 3, 4] is lexicographically smaller than [2, 1, 4, 3].
Problem approach
1. Find pivot no when traverse right to left nums[i-1] < nums[i] #1 3 5 4 2
2. Pick greater no than pivot no from descending order block then swap #1 4 5 3 2
3. Sort out descending order block (5,3,2) in ascending order. Loop-> for k in range((n-i)//2)
output=14235
02
Round
Hard
Face to Face
Duration60 Minutes
Interview date7 Jun 2022
Coding problem2
We need to solve 1 or 2(based on interviewer) coding question within 1 hour in which we need to explain our approach before writing the code and we need to give optimal solution of the approach.
Interviewer also ask some other question related to DBMS, SQL, OOPS concept and etc.
1. Rearrange string
Hard
50m average time
50% success
0/120
Asked in companies
You are given a string “S”. Your task is to rearrange the characters of a string “S”, such that it does not contain any two adjacent characters which are the same.
If it is possible to rearrange the string “S”, then print any possible arrangement. else, print “not possible” without quotes.
For Example:
For a string “qaacde”, This string has two same adjacent characters.
So, one possible way to rearrange the string is “qacade”. Now, this string does not have two adjacent characters that are the same.
2. Right View
Moderate
35m average time
65% success
0/80
Asked in companies
You have been given a Binary Tree of integers.
Your task is to print the Right view of it.
The right view of a Binary Tree is a set of nodes visible when the tree is viewed from the Right side and the nodes are printed from top to bottom order.
Problem approach
Recursive method-
DFS-traverse the tree right-to-left, add values to the view whenever we first reach a new record depth. This is O(n).
def rightSideView(self, root):
def collect(node, depth):
if node:
if depth == len(view):
view.append(node.val)
collect(node.right, depth+1)
collect(node.left, depth+1)
view = []
collect(root, 0)
return view
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
Software Engineer
3 rounds | 5 problems
Interviewed by Adobe
Selected 
1689 views
0 comments
0 upvotes
Software Developer
2 rounds | 4 problems
Interviewed by Adobe
Selected 4530 views
0 comments
0 upvotes
SDE - 2
3 rounds | 5 problems
Interviewed by Adobe
Selected 1694 views
0 comments
0 upvotes
Software Engineer
5 rounds | 5 problems
Interviewed by Adobe
Selected 1005 views
0 comments
0 upvotes
Companies with similar interview experiences
Support Engineer
2 rounds | 3 problems
Interviewed by Amazon
Rejected
3284 views
0 comments
0 upvotes
Support Engineer
4 rounds | 7 problems
Interviewed by Amazon
Selected 8293 views
0 comments
0 upvotes
Support Engineer
2 rounds | 5 problems
Interviewed by Amazon
Rejected
2776 views
0 comments
0 upvotes