Salesforce Interview Questions, Process, and Tips

Round duration - 60 minutes
Round difficulty - Easy

Timing - flexible 12 hours window to take the test. (9AM - 9PM)
Test was proctored

Q1. Combination Sum
You have been given three numbers ‘X’, ’Y’ and ‘Z’. You have to find the sum of all the numbers formed by the combination of the digits 3, 4 and 5. You can use 3 at most ‘X’ times, 4 at mos...read more
Ans. 
This was a online test.
This is a standard DP question.
I solved it in Time Complexity: O(N*m)
Answered by CodingNinjas
View 2 more amswers
Q2. Longest Path In Directed Graph
You are given a Weighted Directed Acyclic Graph (DAG) consisting of ‘N’ nodes and ‘E’ directed edges. Nodes are numbered from 0 to ’N’-1. You are also given a source node ‘Sr...read more
Ans. 
This is a problem of topological sorting.

Time complexity of topological sorting is O(V+E). After finding topological order, the algorithm process all vertices and for every vertex, it runs a loop for all adjacent vertices.

overall time complexity of this algorithm is O(V+E).
Answered by CodingNinjas
View 2 more amswers

Round duration - 40 minutes
Round difficulty - Easy

Timing - 9:00 AM - 9:40 AM

Q1. Smallest Number With At least N Trailing Zeros In Factorial
You are given a positive integer N. Your task is to find the smallest number whose factorial contains at least N trailing zeroes.
Example :
Let...read more
Ans. 
Step 1 - Trailing 0s in x! = Count of 5s in prime factors of x!
= floor(x/5) + floor(x/25) + floor(x/125) + ....
Step 2 - We can notice that, the maximum value whose factorial contain n trailing zeroes is 5*n.

Step 3 -So, to find minimum value whose factorial contains n trailing zeroes, use binary search on range from 0 to 5*n. And, find the smallest number whose factorial contains n trailing zeroes.
Answered by CodingNinjas
View 2 more amswers
Q2.  Reverse Linked List
Given a singly linked list of integers. Your task is to return the head of the reversed linked list.
For example:
The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then t...read more
Ans. 
We return the pointer of next node to his previous(current) node and then make the previous node as the next node of returned node and then returning the current node.
We first traverse till the last node and making the last node as the head node of reversed linked list and then applying the above procedure in the recursive manner.
Answered by CodingNinjas
View 5 more amswers

Round duration - 40 minutes
Round difficulty - Easy

Timing - 12:00 Pm to 12:40 PM

Q1. Implement a priority queue
Ninja is given a task to implement a priority queue using Heap data structure. The Ninja is busying preparing for the tournament., So he asked for your help.
Your task is to us...read more
Ans. 
A typical priority queue supports the following operations:
Insertion
Deletion
top
Answered by CodingNinjas
View 1 more amswer
Q2. Largest BST subtree
You are given a binary tree with 'N' nodes. Your task is to return the size of the largest subtree of the binary tree which is also a BST.
A binary search tree (BST) is a bina...read more
Ans. 
1) Whether the subtree itself is BST or not 
2) If the subtree is left subtree of its parent, then maximum value in it. And if it is right subtree then minimum value in it. 
3) Size of this subtree if this subtree is BST
Answered by CodingNinjas
View 2 more amswers

Round duration - 40 minutes
Round difficulty - Medium

Timing - 6:00 PM - 6:30 PM

Q1. System Design Question
Design Splitwise and change 3 features that you dont like about it.
Ans. 
Tip 1: Be comfortable with all OOPS concepts.
Tip 2: They expected me to code in JAVA though I practiced DS algo in c++. So make sure you know atleast basics of java/python.
Answered by CodingNinjas
Add your answer

Round duration - 25 minutes
Round difficulty - Medium

The interview was scheduled at 2pm and it began exactly at the same time. The interview was pretty good and the interviewer was very calm and humble. He asked me many questions based on my project and I was able to answer all of them. One incident that I wants to tell you is that the interviewer asked me a question in which I was stucked I tried my best to answer that question but I was not able to answer it then the interviewer asked me to take a deep breath and then try to give the answer and guess what happened, I was able to answer that question.

Q1. How do you enable Pagination using CSS3?
Add your answer
Q2. HTML
Which of the HTML5 elements support media content?
Add your answer
Q3. Operating System
How can you reduce page loading time?
Add your answer

Q1. Purely depends on the interviewer. They do not follow standard procedure.
Add your answer