salesforce logo
Salesforce· MTS I

Salesforce MTS Interview Experience | India | 2026

Location
India
Posted
3 Sept 2026
140 reads

Summary

I completed all interview rounds for a Salesforce MTS position in India, but the role was later closed.

How it went

A Salesforce recruiter reached out to me directly regarding the MTS opportunity.

Round 1 - HackerRank OA

  • Don't remember the exact questions.
  • Finished on time and covered the edge cases.

Round 2 - Technical

1. Valid Parentheses

  • Explained stack approach and coded it.
  • Discussed edge cases.

2. Budget / Project Selection

  • Pick/not-pick DP.
  • Explained approach, coded it, and covered edge cases.

Round 3 - Technical

1. Path With Maximum Probability

  • Graph problem.
  • Used DFS while maintaining the maximum probability to reach each node.

2. House Robber

  • Standard DP.
  • Coded and discussed edge cases.

Round 4 - Technical

LRU Cache

  • Implemented LRU Cache with O(1) `get` and `put` using HashMap + Doubly Linked List.
  • Interviewer was satisfied with the solution and explanation.
  • We ran short on time, so we moved to discussion around my current work and experience.

Round 5 - Hiring Manager

  • No DSA/coding.
  • Discussion around my current projects, responsibilities, technical challenges, and AI-related work.

Outcome

Completed the entire interview process.

Unfortunately, I was informed afterward that the position had been closed. The recruiter said they would keep my profile in consideration and reach out if a suitable MTS opening becomes available.

Questions asked (5)

  1. 01

    Valid Parentheses

    Data Structures & Algorithms · Easy

    Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. An input string is valid if open brackets are closed by the same type of brackets, and open brackets are closed in the correct order.

  2. 02

    Budget / Project Selection (DP)

    Data Structures & Algorithms · Medium

    Given a list of projects each with a required budget and an expected profit, and a total budget limit, select a subset of projects such that the total profit is maximized while staying within the budget.

  3. 03

    Path With Maximum Probability

    Data Structures & Algorithms · Medium

    Given an undirected weighted graph where each edge has a success probability, and two nodes start and end, find the path from start to end that maximizes the product of probabilities along the edges.

  4. 04

    House Robber

    Data Structures & Algorithms · Medium

    Given an array of non‑negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting the police (you cannot rob two adjacent houses).

  5. 05

    LRU Cache

    Data Structures & Algorithms · Medium

    Design and implement a data structure for a Least Recently Used (LRU) cache. It should support get(key) and put(key, value) operations in O(1) time.

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!