Salesforce interview experience Real time questions & tips from candidates to crack your interview

Technical Consultant

Salesforce
upvote
share-icon
3 rounds | 7 Coding problems

Interview preparation journey

expand-icon
Journey
"Salesforce, the Customer Success Platform and the world's #1 CRM, empowers companies to connect with their customers in a whole new way. The company came to our college for the role of Technical Consultant. There were three rounds: Coding Test, Technical Interview, and Managerial/HR Interview. Over 350 students participated in the drive, and eight were shortlisted in the final round.
Application story
I applied through an on-campus drive for the role of Technical Consultant. The company came to our college for this position. There were three rounds: a Coding Test, a Technical Interview, and a Managerial/HR Interview. Over 350 students participated in the drive, and eight were shortlisted in the final round.
Why selected/rejected for the role?
I was rejected for this role in the Technical Interview round as it was heavily focused on networking, but I didn't know much about networking. Thus, I couldn't give the satisfactory answers they sought. Therefore, I got rejected for this round.
Preparation
Duration: 3 months
Topics: RDBMS, Javascript, Java, C++, Networking, Analytical Skills
Tip
Tip

Tip 1: Study databases in detail. 

Tip 2: Maintain at least a 7 CGPA in your graduation degree. 

Tip 3: Gain extensive knowledge of networking.

Application process
Where: Campus
Eligibility: 7 CGPA
Resume Tip
Resume tip

Tip 1: Mention networking and database skills in your resume.  
Tip 2: It is better to include networking projects or certifications in your resume.

Interview rounds

01
Round
Medium
Online Coding Test
Duration90 minutes
Interview date24 Oct 2021
Coding problem3

This round was conducted online on the Hackerrank platform. There were three coding questions that can be attempted in any coding language.

1. First Missing Positive

Moderate
18m average time
84% success
0/80
Asked in companies
DunzoHikeSamsung

You are given an array 'ARR' of integers of length N. Your task is to find the first missing positive integer in linear time and constant space. In other words, find the lowest positive integer that does not exist in the array. The array can have negative numbers as well.

For example, the input [3, 4, -1, 1] should give output 2 because it is the smallest positive number that is missing in the input array.

Problem approach

Step 1: Remove all negative numbers and zeros from the array since they are not considered for finding the missing positive integer. .

Step 2: Iterate through the array and place each positive integer in its correct position by swapping it with the element at the corresponding index (i.e., place the number 1 at index 0, number 2 at index 1, and so on). 

Step 3: After placing all positive integers in their correct positions, iterate through the modified array again to find the first index where the value does not match its corresponding index. This index represents the lowest missing positive integer. 

Step 4: If all positive integers are present from 1 to n (where n is the size of the modified array), the missing positive integer is n + 1.

Try solving now

2. Traffic Lights

Moderate
15m average time
85% success
0/80
Asked in company
Salesforce

There is a street of length X with positions numbered from 0 to X (0,1,…, ’X’). Initially, there are no traffic lights in these slots. Later ‘N’ sets of traffic lights are added to the street one after another. The ‘POS’ array tells the position of the ‘i’th light.

Your task is to calculate the length of the longest passage without traffic lights after each addition.

For example:

Given:- ‘X’ = 5 and ‘N’ = 2.
‘POS’[] = 3, 4
The output will be 3 and 3.
Initially, there are no lights, and we install a light at position three; therefore, there is a segment between the 3 and 6. 
Then we install a light at position four; therefore, the largest gap becomes between 0 to 3.
Problem approach

Step 1: Create an array spray of size n, initialized with 0s. This array will represent the coverage of fountains on the road.
Step 2: Iterate through the locations array. For each fountain at index i, calculate its leftmost and rightmost coverage limits.
Step 3: Update the spray array to mark the coverage of each fountain. For each fountain at index i, mark the range from left to right as 1 in the spray array.
Step 4: Initialize end to 0 and farthest to 0. These variables represent the current fountain's rightmost coverage and the farthest coverage reachable by currently turned on fountains, respectively.
Step 5: Initialize fountains to 0. This variable will count the minimum number of fountains needed to cover the road.
Step 6: Iterate through the spray array from index 0 to n - 1. For each index i:
Step 7: Update farthest to max(farthest, spray[i]) to keep track of the farthest coverage reachable by currently turned on fountains.
Step 8: If end is equal to i, it means the current fountain's coverage has ended. Increment fountains by 1 and update end to farthest since a new fountain needs to be turned on to cover the next range.
Step 9: Return the value of fountains, which represents the minimum number of fountains needed to cover the road.

Try solving now

3. Convert Bst To The Greater Sum Tree

Moderate
30m average time
70% success
0/80
Asked in companies
CultfitMathworksIntuit

You have been given a Binary Search Tree of integers. You are supposed to convert it to a greater sum tree such that the value of every node in the given BST is replaced with the sum of the values of all the nodes which are greater than the value of the current node in the tree.

A Binary Search Tree is a tree, whose internal nodes each store a value greater than all the values in the node's left subtree and less than those in its right subtree.

Note :

You need to modify the given tree only. You are not allowed to create a new tree.
For example:
For the given binary search tree

Example

11 will be replaced by {15 + 29 + 35 + 40}, i.e. 119.
2 will be replaced by {7 + 11 + 15 + 29 + 35 + 40}, i.e. 137.
29 will be replaced by {35 + 40}, i.e. 75.
1 will be replaced by {2 + 7 + 11 + 15 + 29 + 35 + 40}, i.e. 139.
7 will be replaced by {11 + 15 + 29 + 35 + 40}, i.e. 130.
15 will be replaced by {15 + 29 + 35 + 40}, i.e. 104.
40 will be replaced by 0 {as there is no node with a value greater than 40}.
35 will be replaced by {40}, i.e. 40.
Try solving now
02
Round
Hard
Video Call
Duration60 minutes
Interview date25 Oct 2021
Coding problem2

This round was conducted in the afternoon. The interviewer was good. It mostly consisted of questions about networking and databases. Only 14 students were shortlisted after this round.

1. Network Questions

What are the different network topologies available?(Learn)

What is the difference between an IP address and a MAC address?(Learn)

Explain the OSI model in detail.(Learn)

What is the difference between the TCP model and the OSI model?(Learn)

What is the difference between thread and process?(Learn)

Problem approach

Tip 1 : Study networking in detail.
Tip 2 : Hear the question carefully.

2. DBMS Question

What are the different types of normalization? (Learn)

Write an SQL command to create a table and insert the entries in that table. (Learn)

What are the different types of JOINS in SQL? (Learn)

Problem approach

Tip 1 : Study normalization in databases.
Tip 2 : Answer confidently.

03
Round
Medium
HR Round
Duration30 minutes
Interview date26 Oct 2021
Coding problem2

This round was conducted in the morning. It had a mixture of problem-solving and HR questions. Only 8 students got selected after this round.

1. Basic HR Question

  • If the selling price is doubled, the profit triples. Find the profit percent.
  • There are two examination rooms, A and B. If 10 students are sent from A to B, then the number of students in each room is the same. If 20 candidates are sent from B to A, then the number of students in A is double the number of students in B. Find the number of students in room A.
  • A bag contains 2 red, 3 green, and 2 blue balls. Two balls are drawn at random. What is the probability that none of the balls drawn is blue?
Problem approach

Tip 1 : Keep pen and paper by your side.
Tip 2 : Practice aptitude questions in advance.
Tip 3 : Don't take much time in telling an answer.

2. Basic HR Questions

Introduce yourself.

Are you ready to relocate?

What are your strengths and weakness?

Problem approach

Tip 1 : Keep pen and paper by your side.
Tip 2 : Practice aptitude questions in advance.
Tip 3 : Don't take too much time in giving an answer.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

How do you remove whitespace from the start of a string?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
4 rounds | 7 problems
Interviewed by Salesforce
3386 views
0 comments
0 upvotes
company logo
Technical Consultant
3 rounds | 4 problems
Interviewed by Salesforce
1767 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 4 problems
Interviewed by Salesforce
1152 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3639 views
0 comments
0 upvotes