Salesforce Interview Questions, Process, and Tips

Round duration - 75 Minutes
Round difficulty - Medium

This was an online coding round where we had 2 questions to solve under 75 minutes. The questions were of Medium to Hard level of difficulty and I found the problem statements to be a bit tricky.

Q1. Balanced parentheses
Given an integer ‘N’ representing the number of pairs of parentheses, Find all the possible combinations of balanced parentheses with the given number of pairs of parentheses.
Note :
...read more
Ans. 
Approach : 

1) First make a recursive function, say ‘solve’ taking the number of opening brackets ‘opening’, number of closing brackets ‘closing’ output string ‘output’, and an array of strings ‘ans’ as arguments.

2) Make the base condition as if ‘opening’ = 0 and ‘closing’ = 0 then push the output string in the ‘ans’ and return.

3) If ‘opening’ is not equal to zero then call the ‘solve’ function recursively by decre...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. 
Approach : 

1) Let the 'X', 'Y', 'Z' be the maximum availability ‘a’, ‘b’, ‘c’ respectively.

2) Declare an empty string say ‘S’ to store the answer string.

3) Run a loop till (x + y + z)
3.1) If ( 'X' >= 'Y' and 'X' >= 'Z' and the last two letters in ‘S’ is not “aa” ) or ( the last two letters in ‘S’ are “bb” or “cc” and 'X' is nonzero).
Add ‘a’ to ‘S’, and update 'X' to ‘x - 1’.

3.2) If ( 'Y' >= 'X' and 'Y' &g...read more
Answered by CodingNinjas
View 3 more amswers

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 preety decent questions of DSA . The interviewer was also quite freindly and helpful. I was able to solve both the questions under the given time frame and also discussed their respective time and space complexites.

Q1. Print All Paths
You are given a graph with ‘N’ nodes and ‘M’ unidirectional edges. Also you are given two integers ‘S’ and ‘D’ denoting the source and destination. Your task is to find all the paths from ...read more
Ans. 
Approach (Using Backtracking) : 

Let ‘allAllPaths(n, m, edges, src, des)’ be the function that returns a 2D array that contains all the possible paths.

1) Take the following variables: 2D array ‘Graph’, to store graphs and ‘Visited’ array to mark each node whether it is visited or not.

2) Clear graph, initialize the visited array to false.

3) Run a loop from 0 to 'm' :
3.1) Add the undirected edge between edges[i] [0] ...read more
Answered by CodingNinjas
View 1 more amswer
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. 
Approach : 

1) Initialize slow and fast at the beginning.

2) Start moving slow to every next node and moving fast 2 jumps, while making sure that fast and its next is not null.

3) If after adjusting slow and fast, if they are referring to the same node, there is a cycle otherwise repeat the process

4) If fast reaches the end or null then the execution stops and we can conclude that no cycle exists.


TC : O(N), where N =
Answered by CodingNinjas
View 3 more amswers

Round duration - 60 Minutes
Round difficulty - Medium

This round had 1 question related to BST followed by some standard questions from OOPS and Operating Systems.

Q1. Pair with Given Sum in a Balanced BST
You are given the ‘root’ of a Balanced Binary Search Tree and an integer ‘target,’ you have to tell if there exists any pair of nodes such that the sum of their value ...read more
Ans. 
Approach : 

1) Maintain a hash-map ‘mp,’ which keeps track of the nodes we have visited.

2) We will use a helper function, ‘helper’.

3) ‘helper’ takes ‘root,’ ‘target,’ and ‘mp’ as input parameters, where ‘root’ is the root of the binary tree, ‘target’ is the value which should be equal to sum of 2 nodes and ‘mp’ is the hash-map we use to keep track of nodes visited.

3.1) For a given root ‘toFind’ value is the other h...read more
Answered by CodingNinjas
View 2 more amswers
Q2. OOPS Question
What is Early Binding and Late Binding in C++ ?
Ans. 
OOP is used commonly for software development. One major pillar of OOP is polymorphism. Early Binding and Late
Binding are related to that. Early Binding occurs at compile time while Late Binding occurs at runtime. In method
overloading, the bonding happens using the early binding. In method overriding, the bonding happens using the late
binding. The difference between Early and Late Binding is that Early Binding uses the...read more
Answered by CodingNinjas
Add your answer
Q3. OS Question
What is deadlock? How to prevent deadlock?
Ans. 
Deadlock : Deadlock is a scenario where a set of processes is blocked because each process has acquired a lock on
a particular resource and is waiting for another resource locked by some other process.
A deadlock can occur in almost any situation where processes share resources. It can happen in any computing
environment, but it is widespread in distributed systems, where multiple processes operate on different resources.

...read more
Answered by CodingNinjas
Add your answer
Q4. OS Question
What is meant by Multitasking and Multithreading in OS?
Ans. 
Multitasking : It refers to the process in which a CPU happens to execute multiple tasks at any given time. CPU
switching occurs very often when multitasking between various tasks. This way, the users get to collaborate with
every program together at the same time. Since it involves rapid CPU switching, it requires some time. It is because
switching from one user to another might need some resources. The processes in mult...read more
Answered by CodingNinjas
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This was my last round and I hoped it to go good just like the other rounds. The interviewer was very straight to point
and professional. The interview lasted for 30 minutes.

Q1. Basic HR Question
Tell me something not there in your resume.
Ans. 
If you get this question, it's an opportunity to choose the most compelling information to share that is not obvious from
your resume.

Example :

Strength -> I believe that my greatest strength is the ability to solve problems quickly and efficiently, which makes me
unique from others.

Ability to Handle Pressure -> I enjoy working under pressure because I believe it helps me grow and become more
efficient .


Tip : Emphasi...read more
Answered by CodingNinjas
Add your answer

Q1. They asked from basic to all senarios and solutions.
Add your answer

They gave one troubleshoot and sample use case preparation with all futures of the API

Q1. Tell me about your roles and responsibilities in your previous Org's.
Add your answer

If you mentioned in your resume

Q1. All about your Salesforce knowledge
Add your answer
Q2. Which skills you mentioned
Add your answer

Q1. With manager about your behaviour
Add your answer

Q1. Discuss about company policy and package
Add your answer