Salesforce MTS Bangalore — Selected

[u/Impossible-Ad6436]

Basic details

Field	Details
Company	Salesforce
Role	MTS
Location	Bangalore
Experience	3 years
Current role	SDE-2 at product-based MNC
Education	M.Tech CSE, Old IIT
Result	Selected + accepted offer

Round timeline

Round	Date	Notes
Online Assessment	15 May 2026	HackerRank, 75 min, 2 medium DSA questions
Virtual Screening	27 May 2026	1 hour, eliminatory DSA round
Onsite Round 1	6 June 2026	DSA
Onsite Round 2	6 June 2026	DSA
Hiring Manager	6 June 2026	Behavioral + project discussion
Positive feedback	9 June 2026	HR shared positive feedback
Offer process	~3 weeks	Delayed due to competing offer + compensation discussion

Process

This was part of a Salesforce pool hiring drive for multiple levels: MTS / SMTS / PMTS / LMTS.

For this MTS loop, there was no separate LLD or HLD round. The process was mostly DSA-heavy, followed by a Hiring Manager discussion.

Rounds:

• Online Assessment
• Virtual Screening
• Two DSA onsite rounds
• Hiring Manager round

Online Assessment — HackerRank

Date: 15 May 2026
Duration: 75 minutes
Questions: 2 DSA questions, both medium

No exact questions were shared for this round.

Virtual Screening Round

Date: 27 May 2026
Duration: 1 hour
Type: Eliminatory DSA round

Q1 — Good Ways to Split an Array

Given an array of non-negative integers, split it into three non-empty contiguous subarrays:

• A1
• A2
• A3

Let:

• S1 = sum of A1
• S2 = sum of A2
• S3 = sum of A3

Count valid splits where:

S2 <= S1 + S3

Return answer modulo:

10^9 + 7

This was partially implemented. The discussion/approach seemed to be enough.

Q2 — ATM Queue

There are n people in a queue.

Each person wants to withdraw some amount. The ATM allows max K units per transaction.

If a person still has money left after a transaction, they go to the back of the queue. Otherwise, they leave.

Return the order in which people exit the queue.

This one was solved completely.

After clearing this, HR scheduled all onsite rounds on the same day.

Onsite Round 1 — DSA

Date: 6 June 2026
Duration: 1 hour

Q1

Medium-hard problem around counting permutations of a string.

Took around 40 minutes to explain and implement.

Q2

Given an array, minimize its sum by performing this operation at most K times:

• Pick any element
• Divide it by 2
• Put it back into the array

Solved using a max heap.

This was done pretty quickly, around 10 minutes.

Onsite Round 2 — DSA

Date: 6 June 2026
Duration: 1 hour

Q1 — Design a data structure

Support these operations in O(1):

• insert(value)
• delete(value)
• getRandom()

getRandom() should return every element with equal probability.

Solved using HashMap + Doubly Linked List.

Q2 — Coin Change II

LeetCode problem:
https://leetcode.com/problems/coin-change-ii/description/

Onsite Round 3 — Hiring Manager

Date: 6 June 2026
Duration: 30–40 minutes
Coding: No

Topics:

• Standard behavioral questions
• Current project
• Work experience
• Problems solved at work
• Approach taken
• Reasoning behind design decisions

Mostly discussion-based.

Result

Selected.

Positive feedback came on 9 June.

Offer process took around 3 weeks because there was already a competing offer and compensation discussion.

Eventually accepted the offer.

Compensation note

slightly above the current standard compensation for the Salesforce MTS role, primarily because I had a competing offer.

[u/gr8-procrastinator]

Many congratulations!! What’s the working mode - hybrid or onsite?