Salesforce Member Technical Staff Interview Questions, Process, and Tips

Leetcode Easy to Medium

Q1. Scenario based questions
Add your answer
Q2. Leetcode Medium
Add your answer

Q1. Questions about how to deal with challenges while working in a team
Add your answer

Q1. Just basic screening questions about package and notice period
Add your answer

Hackerrank coding round asking me to wite a trigger that performed some functionality

Q1. This was an architectural round going through business case scenario and various ways it could be solved
Add your answer

Q1. This was a managerial round mostly around behavioural questions.
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

Online coding assessment having 20 MCQs and 2 coding questions

Q1. 
Spiral Matrix Problem Statement
You are given a N x M matrix of integers. Your task is to return the spiral path of the matrix elements.
Input
The first line contains an integer 'T' which denotes the nu...read more
Ans. 
The task is to return the spiral path of elements in a given matrix.
• Iterate through the matrix in a spiral path by keeping track of boundaries.

• Print elements in the order of top row, right column, bottom row, and left column.

• Continue the spiral path until all elements are printed.
Answered by AI
Add your answer
Q2. 
Longest Happy String Problem Statement
Given three non-negative integers X, Y, and Z, determine the longest happy string. A happy string is defined as a string that contains only the letters 'a', 'b', and...read more
Ans. 
The longest happy string problem involves constructing a string with 'a', 'b', and 'c' without having any three consecutive letters being the same.
• Determine the maximum number of times 'a', 'b', and 'c' can appear in the string based on the given input values.

• Construct the longest happy string by alternating between 'a', 'b', and 'c' while respecting the constraints.

• Return '1' if a correct happy string can be formed, o
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

The first interview round was fairly easy, and the interviewer was very helpful. It was an hour long interview.

Q1. 
Buy and Sell Stock Problem Statement
Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...read more
Ans. 
The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.
• Iterate through the array of stock prices to find the maximum profit that can be achieved by buying and selling stocks at different points.

• Keep track of the maximum profit that can be achieved by considering all possible combinations of buy and sell transactions.

• Ensure that y...read more
Answered by AI
Add your answer
Q2. 
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next points back to a previous node in the ...read more
Ans. 
Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.
• Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.

• If the two pointers meet at any point, there is a cycle in the linked list.

• Use Floyd's Cycle Detection Algorithm for efficient detection of cycles in linked lists.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

It was a long interview, although the interviewer was again very friendly. The main focus was on problem solving in this round too.

Q1. 
Minimum Swaps to Sort Array Problem Statement
Given an array arr of size N, determine the minimum number of swaps required to sort the array in ascending order. The array consists of distinct elements onl...read more
Ans. 
The minimum number of swaps required to sort an array of distinct elements in ascending order.
• Use a hashmap to store the index of each element in the array.

• Iterate through the array and swap elements to their correct positions.

• Count the number of swaps needed to sort the array.
Answered by AI
Add your answer
Q2. 
Optimal Strategy for a Coin Game
You are playing a coin game with your friend Ninjax. There are N coins placed in a straight line.
Here are the rules of the game:
1. Each coin has a value associated wit...read more
Ans. 
The problem involves finding the optimal strategy to accumulate the maximum amount in a coin game with specific rules.
• Start by considering the base cases where there are only 1 or 2 coins.

• Use dynamic programming to keep track of the maximum amount that can be won at each step.

• Consider the different scenarios when choosing a coin from either end of the line.

• Keep track of the total winnings for both players and choose th...read more
Answered by AI
Add your answer