Adobe Customer Success Manager Interview Questions and Answers

From the given scenario, draw a solution with Microsoft products for a customer

Group discussion way quite poor and not well organized

Q1. In this round, I presented my presentation about a given scenario and I replied to some behavioral questions. I was interviewed in European country so they also tested a bit my language skills related to l...read more
Add your answer
Q2. Local language skills
Add your answer
Q3. Presentation based questions
Add your answer

Q1. Basic account management and service/support and sales questions
Add your answer

Present a sales pitch for a cloud migration

Round duration - 60 minutes
Round difficulty - Medium

Q1. 
Find All Anagrams Problem Statement
Given a string STR and a non-empty string PTR, identify all the starting indices of anagrams of PTR within STR.
Explanation:
An anagram of a string is another string ...read more
Ans. 
Given a string STR and a non-empty string PTR, find all starting indices of anagrams of PTR within STR.
• Create a frequency map of characters in PTR.

• Use sliding window technique to check anagrams in STR.

• Return the starting indices of anagrams found.
Answered by AI
Add your answer
Q2. 
Subset Sum Problem Statement
Given an array of integers, find the sum of all subsets in non-decreasing order of the given array.
Example:
Input:
N = 3, array = [1, 2]
Output:
[0, 1, 2, 3]
Explanatio...read more
Ans. 
Find sum of all subsets in non-decreasing order of given array.
• Use recursion to generate all subsets of the array

• Calculate sum of each subset and store in a list

• Sort the list in non-decreasing order to get the final result
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

First he asked me to tell about myself, then he asked me some OOPS Concepts,difference in shallow copy and deep copy,
asked me to write a code for boundary traversal of binary tree.

Q1. 
Boundary Traversal of Binary Tree Problem Statement
Given a binary tree consisting of integers, your task is to provide the boundary nodes of this tree in an anti-clockwise direction, starting with the ro...read more
Ans. 
Boundary traversal of a binary tree to find left boundary, right boundary, and leaf nodes in an anti-clockwise direction.
• Perform a pre-order traversal to get the left boundary nodes

• Perform an in-order traversal to get the leaf nodes

• Perform a post-order traversal to get the right boundary nodes

• Combine the results to get the boundary nodes in anti-clockwise direction
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

The second tech interview lasted for about an hour and half. First he asked me to tell about myself. Then he asked me how my first interview was. He then asked me where should I start, data structures, databases, to which I replied anywhere.
He started asking questions about C. He asked difference between call by pointer and call by reference. Whether a function can be defined as
void function(int &x, int &y);
Then he asked what is volatile data type in C. Then about the static data class.
He also asked me to write a program to find length of a string.
Then he asked about how functions in C work. How does the program know where to go back after a function is over, etc.
He then asked me if I knew C++, I said no. So he continued to ask a few questions on data structures.
He then asked about the ACID properties which a good database must have. He asked how are transactions managed by a database, what are commits, how, in case of a power failure, data is reverted back, etc.
Then he asked me whether I like to work individually or in a team. I said in a team. He then gave me scenario where I have to decide between a project I am working on, whose deadline is approaching, and helping a friend working on another project whose deadline is also approaching, and asked me what would I do in such a case.

Q1. 
Find the Middle of a Linked List
This problem requires you to return a pointer that references the middle node of a singly linked list.
Explanation:
If the number of elements in the linked list is odd, ...read more
Ans. 
Return the middle node of a singly linked list, considering odd and even number of elements.
• Traverse the linked list with two pointers, one moving twice as fast as the other

• When the fast pointer reaches the end, the slow pointer will be at the middle

• Return the node pointed to by the slow pointer as the middle node
Answered by AI
Add your answer