Salesforce Member Technical Staff Interview Questions, Process, and Tips

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. Spiral Matrix
Divide the matrix into loops. Print all the elements in the clockwise order from the first-outer layer, followed by the elements from the second outer layer, and so on. Use four loops to print all the elements. Every ‘for’ loop defines a single direction movement along with the matrix. The first loop represents the movement from left to right, the second loop represents the movement from top to bottom, the...read more
Answered Anonymously
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. Brute Force Approach
Given 'X', 'Y' 'Z' you can try all combinations of possible strings and return the string that has a maximum length. You can create all possible strings by inserting all the three letters i.e. ‘a’, ‘b’, ‘c’ at each ‘i -th’ position in string by taking care of the condition that no three characters should be the same. For example at ‘i -th’ position in the string you can add the letter ‘a’, if and on...read more
Answered Anonymously
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. Recursion
This problem can be solved by solving its subproblems and then combining the solutions of the solved subproblems to solve the original problem. We will do this using recursion.
Basically, we have to buy the stock at the minimum possible price and sell at the maximum possible price, keeping in mind that we have to sell the stock before buying it again.
 
 
Below is the detailed algorithm: 
 
1. Call ...read more
Answered Anonymously
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. Outer And Inner Loop
We are going to have two loops outer-loop and inner-loop 
1. Maintain a count of the number of nodes visited in outer-loop.
2. For every node of the outer-loop, start the inner loop from head.
3. If the inner-loop visits the node next to the outer-loop node, then return true, else repeat the process for the next iteration of outer-loop.
4. If outer-loop reaches the end of list or null, then return false.
Space ...read more
Answered Anonymously
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. Hash Map ApproachSpace Complexity: O(1)Explanation: Time Complexity: O(1)Explanation:
Answered Anonymously
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. Recursive Brute Force
• Suppose it's your turn and you are left with coins in the index range ['I', ‘J’] (other coins have already been picked up in previous turns). You have the option to pick either ith or jth coin. Of these two options, you would select the one which maximizes your winning amount.
  • If you pick the ith coin. The other player will have the option to pick ('I'+1)th or ‘J’th coin.
    → If the other player picks ...read more
Answered Anonymously
Add your answer