Salesforce | MTS (SDE-2) | Interview Experience | Rejected

salesforce logo
salesforce
MTS (SDE-2)Bangalore3.1 years
June 8, 20253 reads

Summary

I interviewed for a MTS (SDE-2) role at Salesforce in Bangalore and went through multiple DSA and behavioral rounds. Despite performing well in DSA, I was ultimately rejected due to mixed reviews from the managerial/behavioral rounds.

Full Experience

Salesforce MTS Interview loop (Mar, 2025)

YOE: 3.1 Yrs
Current Company: Reputbable Fintech
Location: Bangalore

Round 0 (March last week):
Hacker Rank (OA) Haven't remembered questions.
But the questions were pretty diffuclt and need 80% cut-off.
Got call from HR after a week, for further rounds.

Round 1: (DSA) (1st week of April)

DSA: Product of Array except (LC Medium)
Solved it with O(n) space & runtime complexity.

DSA: Minimum Window Substring (LC Hard)
Solved it with O(n) space & runtime complexity.
Missed an edge case alone, but due to time constrainst, the interviewer said, he is okay with above solution.

--

Round 2: (DSA) (1st week of April, Same day as Round 2)

DSA: A problem given with stream of event objects and print it in the order of end time. Solved using two hashmaps. Tricky question but i would say it is LC Easy.
Solved it in O(n) & O(n) space & time complexity.

DSA: Variation of Daily Temperature LC Medium.
Solved it in O(n) & O(n) space & time complexity.

The round went very well, and answered all the problems with edge cases.
Self Rating: (5/5)

--
Round 3: (Tech + Manager Round) (1.5hr) (IN-PERSON) (2nd week of April)

Got a Call from HR, and told to come to either Banglore/Hyderabad office for final round.

Two people (SMTS & Director) were sitting in a conference room.

SMTS (DSA Round)
A Tree problem, where convert the given sorted list to balanced binary tree. Variation of List to Tree LC Medium. Need to write the code/algorithm in the white board.

Solved it in O(n) & O(n) space & time complexity.

Director (Behavioral Round)
He asked lot of Behavioral and culture fit questions. Some examples:

  • How will u approach the work
  • How will u react to PR comments
  • How will handle critisim from seniors
  • How will u react to design changes.

The round went well, I aced the DSA, but Behavioral went okayish.

--
Round 4: (Manager Round) (1hr) (3rd week of April)

Got a Call from HR, and she told, u got mixed reviews from past manager round, but very postive response from DSA round. So she went ahead and scheduled another manager road. He started with current project and how did u designed the system and Again He asked lot of Behavioral and culture fit questions.

--

I thought I made it, but unformatently I got rejected. These behavioruial rounds are always tricky, don't know what they are expecting or how they will intrept our answers.

Interview Questions (9)

Q1
Product of Array Except Self
Data Structures & AlgorithmsMedium

Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer. You must write an algorithm that runs in O(n) time without using the division operator.

Q2
Minimum Window Substring
Data Structures & AlgorithmsHard

Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no such substring, return the empty string "". The testcases will be generated such that the answer is unique.

Q3
Process Events from Stream by End Time
Data Structures & AlgorithmsEasy

Given a stream of event objects, process and print them in the order of their end time. I solved it using two hashmaps.

Q4
Daily Temperatures (Variation)
Data Structures & AlgorithmsMedium

A variation of the Daily Temperatures problem. Given an array of integers temperatures represents the daily temperatures, return an array answer such that answer[i] is the number of days you have to wait after the ith day to get a warmer temperature. If there is no future day for which this is possible, keep answer[i] == 0 instead.

Q5
Convert Sorted List to Balanced Binary Search Tree (Variation)
Data Structures & AlgorithmsMedium

Given the head of a singly linked list where elements are sorted in ascending order, convert it to a height-balanced binary search tree. I needed to write the code/algorithm on a whiteboard. This was a variation of the LeetCode problem.

Q6
Approach to Work
Behavioral

How will you approach your work?

Q7
Reacting to PR Comments
Behavioral

How will you react to Pull Request comments?

Q8
Handling Criticism from Seniors
Behavioral

How will you handle criticism from seniors?

Q9
Reacting to Design Changes
Behavioral

How will you react to design changes?

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

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