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

# Technical Consultant

Salesforce
3 rounds | 4 Coding problems

## Interview preparation journey

Preparation
Duration: 6 months
Topics: Data Structures, Algorithms Analysis and Design, Coding(C,C++,Java), SQL, Problem Solving
Tip

Tip 1 : Solve atleast 100 coding problems every week
Tip 2 : Prepare in structure like Arrays first then link list and so on
Tip 3 : Have grip on fundas

Application process
Where: Campus
Eligibility: 65% and above and no backlog
Resume tip

Tip 1 : Must have atleast 2 projects
Tip 2 : Must have atleast 2 internships

## Interview rounds

01
Round
Easy
Online Coding Interview
Duration75 Minutes
Interview date17 Aug 2020
Coding problem2

It was similar to other company initial online test rounds which includes MCQs and coding questions

### 1. Rotate array

Easy
25m average time
80% success
0/40

#### Given an array 'arr' with 'n' elements, the task is to rotate the array to the left by 'k' steps, where 'k' is non-negative.

##### Examp...
View more
Problem approach

Initialize A = arr[0..d-1] and B = arr[d..n-1]
1) Do following until size of A is equal to size of B

a) If A is shorter, divide B into Bl and Br such that Br is of same
length as A. Swap A and Br to change ABlBr into BrBlA. Now A
is at its final place, so recur on pieces of B.

b) If A is longer, divide A into Al and Ar such that Al is of same
length a...

View more

### 2. Sort linked list of 0s 1s 2s

Easy
10m average time
90% success
0/40

#### Given a linked list of 'N' nodes, where each node has an integer value that can be 0, 1, or 2. You need to sort the linked list in non-decreasing order and the return t...

View more
Problem approach

1. Traverse the list and count the number of 0s, 1s, and 2s. Let the counts be n1, n2, and n3 respectively.
2. Traverse the list again, fill the first n1 nodes with 0, then n2 nodes with 1, and finally n3 nodes with 2.

02
Round
Hard
Face to Face
Duration60 Minutes
Interview date21 Aug 2020
Coding problem1

It was started with an intro. He asked questions on resume. He asked my preferred language and ask me to solve the question based on that

### 1. Chocolate Problem

Moderate
15m average time
85% success
0/80

#### Given an array/list of integer numbers 'CHOCOLATES' of size 'N', where each value of the array/li...

View more
Problem approach

I was unable to solve this with an optimised approach but here is the detailed steps to solve it:-

To minimise the difference, we must choose consecutive elements from a sorted packet. We first sort the array arr[0..n-1], then find the subarray of size m with the minimum difference between the last and first elements.

03
Round
Easy
HR Round
Duration50 minutes
Interview date18 Jun 2022
Coding problem1

I was not selected for this round but here what my friend told who got selected. He was asked question purely on his resume and then 1 problem solving question.

### 1. Puzzle

There are 100 doors in a row, all doors are initially closed. A person walks through all doors multiple times and toggle (if open then close, if close then open) them in the following way:

In the first walk, the person toggles every door

In the second walk, the person toggles every second door, i.e., 2nd, 4th, 6th, 8th, â€¦ ...

View more

Here's your problem of the day

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

Start a Discussion
Similar interview experiences
Technical Associate
2 rounds | 3 problems
Interviewed by Salesforce
0 views
Technical Consultant
3 rounds | 7 problems
Interviewed by Salesforce
337 views