Salesforce Sales Support Executive Interview Questions and Answers

Round duration - 50 minutes
Round difficulty - Easy

This was a Data Structural round.

Q1. 
Distinct Islands Problem Statement
Given a two-dimensional array/list consisting of integers 0s and 1s, where 1 represents land and 0 represents water, determine the number of distinct islands. A group of...read more
Ans. 
Count the number of distinct islands in a 2D array of 0s and 1s.
• Identify islands by performing depth-first search (DFS) on the grid

• Use a set to store the shape of each island and check for duplicates

• Consider translations to determine distinct islands
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Easy

This was a Data Structural round.

Q1. 
Word Wrap Problem Statement
You are tasked with arranging 'N' words of varying lengths such that each line contains at most 'M' characters, with each word separated by a space. The challenge is to minimiz...read more
Ans. 
The goal is to minimize the total cost of arranging 'N' words on each line with a maximum character limit 'M'.
• Calculate the cost of each line as the cube of extra space characters needed to reach 'M'.

• Minimize the total cost by arranging words to fit within the character limit on each line.

• Ensure each word appears fully on one line without breaking across lines.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was a System Design round.

Q1. Can you design a system similar to Red Bus that can handle bookings and onboard both vendors and customers to the platform?
Ans. 
Design a system similar to Red Bus for handling bookings and onboarding vendors and customers.
• Implement a user-friendly interface for customers to search and book tickets

• Create a vendor portal for vendors to manage their offerings and availability

• Include payment gateway integration for secure transactions

• Develop a robust backend system for managing bookings, cancellations, and refunds

• Utilize a database to store user in...read more
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Easy

This was a System Design round

Round duration - 50 minutes
Round difficulty - Easy

This was an HR round.

Round duration - 45 minutes
Round difficulty - Medium

Technical Interview round with questions on DSA.

Q1. 
Reverse Words in a String: Problem Statement
You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...read more
Ans. 
Reverse words in a string while handling leading, trailing, and multiple spaces.
• Split the input string by spaces to get individual words

• Reverse the order of the words

• Join the reversed words with a single space in between

• Handle leading, trailing, and multiple spaces appropriately
Answered by AI
Add your answer
Q2. 
Reverse a Stack Using Recursion
You are given a stack of integers. Your task is to reverse the stack using recursion without using any extra space other than the internal stack space used due to recursion...read more
Ans. 
Reverse a stack using recursion without using any extra space other than the internal stack space.
• Use recursion to pop all elements from the original stack and store them in function call stack.

• Once the stack is empty, push the elements back in reverse order.

• Base case of recursion should be when the original stack is empty.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Technical Interview round with questions on DSA.

Q1. 
Convert a Binary Tree to its Mirror Tree
Given a binary tree, convert this binary tree into its mirror tree. A binary tree is a tree in which each parent node has at most two children. The mirror of a bin...read more
Ans. 
Convert a binary tree to its mirror tree by interchanging left and right children of all non-leaf nodes.
• Traverse the binary tree in a recursive manner.

• Swap the left and right children of each non-leaf node.

• Continue this process until all nodes have been processed.
Answered by AI
Add your answer
Q2. 
Remove Nth Node from End of Linked List
You are given a singly linked list with 'N' nodes, each containing integer data, and an integer 'K'. Your goal is to remove the 'K'th node counting from the end of ...read more
Ans. 
Remove the Kth node from the end of a singly linked list.
• Use two pointers approach to find the Kth node from the end.

• Handle edge cases like removing the head node or removing the last node.

• Update the pointers to remove the Kth node and reconnect the list.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Typical Managerial round.