salesforce logo
Salesforce· MTS I

Salesforce | MTS | Interview Experience | 2026

Location
BLR
Posted
7 Feb 2026
785 reads

Summary

I successfully navigated through multiple technical rounds involving Data Structures & Algorithms, System Design, and CS fundamentals, including a challenging 'Maximum Profit Triplet' problem and Sudoku Solver implementation, ultimately securing an offer from Salesforce for the MTS role.

How it went

How i got the opportunity?
- I applied through referral.

I received a OA link

Round 1 | OA
i don't remember the questions but they were LC medium level only.
i was able to pass all test cases.

after some days i received the further interview calls.

Round 2 and 3 were scheduled on same day and if you pass first one then only you will be called further.

Round 2 | Technical Interview 1 | DSA
interviewer asked me about one of my project and grilled on it, and cs fundamentals too.

 Question 1 -
 Maximum Profit Triplet

An analyst is reviewing stock performance over n days.

You are given two arrays:

price[i]: stock price on day i

profit[i]: profit on day i

You need to find a triplet of days (i, j, k) such that:

i < j < k (days are in chronological order)

price[i] < price[j] < price[k] (prices are strictly increasing)

The total profit profit[i] + profit[j] + profit[k] is maximized

Output

Return the maximum total profit possible from such a triplet.

If no valid triplet exists, return -1.

Example price = [1, 5, 3, 4, 6] profit = [2, 3, 4, 5, 6]

Output: 15 Explanation: Triplet (3, 4, 5) → prices 3 < 4 < 6 Profit = 4 + 5 + 6 = 15

- i gave a brute force then optimized it to O(n^2) and wrote code for it was able to pass all uts.
- then he asked to optimise it further and i said it could be done using fenwick tree but i don't know the actual implementation of it so won't be able to write code for it.

Question 2 -
i don't remember the actual question and there's no similar question available on LC,
it was related to decode string in some format and there was alot of edge cases i need to handle.

After half an hour i got call that my round 3 is scheduled.

Round 3 | Technical Interview 2 | DSA + LLD

Interviewer asked me what is quick sort algorithm and how does it work, just the approach.
Then, he asked me about DP problems how i approach them difference between bottom-up and top-down approach in detail.
Then, he asked me i have choice of question to implement
1. LRU cache
2. Board game
i said, LRU cache.
he replied now i will ask you a board game 😂
he asked me to implement sudoku solver.
i was able to write complete code on time and then run some test cases.


Next day i got a call that i am selected for onsite round Techno Functional + Managerial round

Round 4 | HM | Managerial + Techno Functional

this was an onsite round and i was asked to come to BLR office.
- current projects HLD on white board (sometimes they might ask you a proper HLD question but as my current projects were good i wasn't asked.)
- managerial & behavioural questions

this round went so well, HM gave me some hints after the interview and she asked me to have coffee and we had coffee together.


After 1-1.5 week got offer - https://leetcode.com/discuss/post/7558469/salesforce-vs-bitgo-compensation-by-jeth-holo/


Follow my profile for more interview experiences - https://leetcode.com/u/jethiya_babuchak/


upvote.jpeg

Questions asked (4)

  1. 01

    Maximum Profit Triplet

    Data Structures & Algorithms · Hard

     Question 1 -
     Maximum Profit Triplet
    
    An analyst is reviewing stock performance over n days.
    
    You are given two arrays:
    
    price[i]: stock price on day i
    
    profit[i]: profit on day i
    
    You need to find a triplet of days (i, j, k) such that:
    
    i < j < k (days are in chronological order)
    
    price[i] < price[j] < price[k] (prices are strictly increasing)
    
    The total profit
    profit[i] + profit[j] + profit[k]
    is maximized
    
    Output
    
    Return the maximum total profit possible from such a triplet.
    
    If no valid triplet exists, return -1.
    
    Example
    price  = [1, 5, 3, 4, 6]
    profit = [2, 3, 4, 5, 6]
    
    Output: 15
    Explanation:
    Triplet (3, 4, 5) → prices 3 < 4 < 6
    Profit = 4 + 5 + 6 = 15
    
    
  2. 02

    Explain Quick Sort Algorithm

    Data Structures & Algorithms · Easy

    Interviewer asked me what is quick sort algorithm and how does it work, just the approach.

  3. 03

    Explain DP Approaches: Bottom-up vs Top-down

    Data Structures & Algorithms · Medium

    Then, he asked me about DP problems how i approach them difference between bottom-up and top-down approach in detail.

  4. 04

    Implement Sudoku Solver

    Data Structures & Algorithms · Hard

    he asked me to implement sudoku solver.

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!