Salesforce Interview Questions, Process, and Tips

Hackerrank Test salesforce technical questions and 2 program

Q1. Data model usecase, technical solution design for use case, governor limits
Add your answer

Q1. Architectural questions, design community, aura and lwc questions, complex scenerios and solutions
Add your answer

Q1. Higher level of technical architect, design principles, design patterns, coding challenges solutions algo
Add your answer

Q1. Hiring Manager , team and work introduction
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

Online coding assessment having 20 MCQs and 2 coding questions

Q1. Spiral Matrix
You are given a N x M matrix of integers, return the spiral path of the matrix
Example Of Spiral Path
Input Format:
The first line contains an integer 'T' which denotes the numb...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 by CodingNinjas
View 1 more amswer
Q2. Longest Happy String
Ninja likes to play with strings, and he calls a string ‘S’ Happy if it only contains letters ‘a’, ‘b’, and ‘c’, and no three consecutive letters in the string are the same. For exampl...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 by CodingNinjas
View 2 more amswers

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
You are Harshad Mehta’s friend. He told you the price of a particular stock for the next ‘N’ days. You can either buy or sell a stock. Also, you can only complete at most 2-transactions....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 by CodingNinjas
View 3 more amswers
Q2. Cycle Detection in a Singly Linked List
You have given a Singly Linked List of integers, determine if it forms a cycle or not.
A cycle 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 by CodingNinjas
View 2 more amswers

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
Given an array 'arr' of size 'N', find the minimum number of swaps required to be made between any two elements to sort the array in ascending order. The array d...read more
Ans. Hash Map ApproachSpace Complexity: O(1)Explanation: Time Complexity: O(1)Explanation:
Answered by CodingNinjas
Add your answer
Q2. Optimal Strategy for a Game
You and your friend Ninjax are playing a game of coins. Ninjax place the 'N' number of coins in a straight line.
The rule of the game is as follows:
1. Each coin has ...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 by CodingNinjas
View 4 more amswers