Cohesity Sales Manager Interview Questions and Answers

Know how you are thinking

Realtime sales scenarios

Q1. Salary discussion
Add your answer
Q2. Why leaving current org?
Add your answer
Q3. How to do ethical sales?
Ans. 
Ethical sales involves honesty, transparency, and putting the customer's needs first.
• Always be honest with customers about your product or service.

• Avoid pressuring customers into making a purchase they are unsure about.

• Listen to the customer's needs and provide solutions that genuinely benefit them.

• Respect customer privacy and confidentiality.

• Ensure all sales practices comply with laws and regulations.

• Build long-term r...read more
Answered by AI
Add your answer
Q4. 5 leadership skills
Add your answer
Q5. Difficult scenarios and how to tackle them
Ans. 
Handling difficult scenarios is crucial in sales management. It requires quick thinking and problem-solving skills.
• Stay calm and composed

• Listen actively to understand the issue

• Offer solutions or alternatives

• Seek feedback and learn from the experience
Answered by AI
Add your answer

Q1. Tell me about yourself
Add your answer

Q1. What are your customer wins
Ans. 
I have successfully closed deals with major clients resulting in increased revenue and long-term partnerships.
• Closed deals with Fortune 500 companies resulting in a 30% increase in sales revenue

• Established long-term partnerships with key clients leading to repeat business

• Implemented successful sales strategies that resulted in a 50% growth in customer base
Answered by AI
Add your answer

Q1. Tell me about past experience
Add your answer

Round duration - 120 Minutes
Round difficulty - Easy

The round was conducted in day around 3PM.

Q1. 
Partition Equal Subset Sum Problem
Given an array ARR consisting of 'N' positive integers, determine if it is possible to partition the array into two subsets such that the sum of the elements in both sub...read more
Ans. 
The problem is to determine if it is possible to partition an array into two subsets with equal sum.
• Use dynamic programming to solve this problem efficiently.

• Create a 2D array to store the results of subproblems.

• Check if the sum of the array is even before attempting to partition it.

• Iterate through the array and update the 2D array based on the sum of subsets.

• Return true if a subset with half the sum is found, false ot
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

The interview was preponed and was conducted at 9AM.
The interviewer was friendly and I had saw him earlier at pre-placement talk.

Q1. 
Convert Sentence to Pascal Case
Given a string STR, your task is to remove spaces from STR and convert it to Pascal case format. The function should return the modified STR.
In Pascal case, words are con...read more
Ans. 
Convert a given string to Pascal case format by removing spaces and capitalizing the first letter of each word.
• Iterate through each character in the string

• If the character is a space, skip it

• If the character is not a space and the previous character is a space or it is the first character, capitalize it
Answered by AI
Add your answer
Q2. Write an SQL query to retrieve the Nth highest salary from a database.
Ans. 
SQL query to retrieve the Nth highest salary from a database
• Use the ORDER BY clause to sort salaries in descending order

• Use the LIMIT clause to retrieve the Nth highest salary

• Consider handling cases where there might be ties for the Nth highest salary
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This round was conducted 15mins after 1st round.

Q1. 
Remove the Kth Node from the End of a Linked List
You are given a singly Linked List with 'N' nodes containing integer data and an integer 'K'. Your task is to delete the Kth node from the end of this Lin...read more
Ans. 
Remove the Kth node from the end of a singly linked list.
• Traverse the list to find the length 'N'.

• Calculate the position of the node to be removed from the beginning as 'N - K + 1'.

• Remove the node at the calculated position.

• Handle edge cases like removing the head or tail of the list.

• Update the pointers accordingly after removal.
Answered by AI
Add your answer