Salesforce MTS Interview Experience India | Offer Accepted

Result
Offer
Location
india
Posted
10 Dec 2025
529 reads

Summary

Successfully cleared the Salesforce MTS interview process in India, securing an offer. The interview included two DSA rounds and a hiring manager round, with the candidate demonstrating strong problem-solving skills in BFS and DFS problems.

How it went

After clearing the HackerRank round, I received a call from the recruiter for further rounds. Initially, I was told there would be three rounds: DSA, System Design (LLD), and Hiring Manager. However, the plan was adjusted to two DSA rounds and one Hiring Manager round.

DSA Round 1:
1. Rotting Oranges - A simple BFS question that I solved easily.
2. Binary Search in Rotated Array - Another straightforward question that I managed to solve.

DSA Round 2:
1. Maximum Gold in Grid - A DFS/BFS problem that I solved but had some difficulty with time and space complexity.
2. Transform String - A challenging question not on LeetCode. I came up with a solution but failed to handle edge cases and couldn't solve it in time.

Hiring Manager Round:
The round was relatively simple, focusing on discussing my career switch and shared interests in contact centers, as both the manager and I had prior experience in this domain.

Questions asked (3)

  1. 01

    Rotting Oranges

    Data Structures & Algorithms · Medium

    Given a grid representing oranges in a farm, where some oranges are rotten and others are fresh. Rotten oranges can rot adjacent fresh oranges in a certain time frame. The task is to determine the number of minutes that must elapse until no fresh oranges remain.

    Open the problem
  2. 02

    Binary Search in Rotated Array

    Data Structures & Algorithms · Medium

    Given a sorted array that has been rotated at some pivot point, find the index of a target value using binary search. The array may contain duplicates, which adds complexity to the search.

    Open the problem
  3. 03

    Maximum Gold in Grid

    Data Structures & Algorithms · Hard

    Given a grid representing gold deposits, find the maximum amount of gold that can be collected by moving through the grid. Movement is allowed in four directions, and each cell can be visited only once.

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Salesforce recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!