Salesforce MTS Interview Experience | Bengaluru
Summary
I was hired for the MTS role at Salesforce in Bengaluru after a multi-round interview process that included online assessment, technical deep dives, system design, and a hiring manager discussion.
Full Experience
Salesforce Interview Experience (SDE) – Hired
Background
- Current Company: Oracle
- Total Experience: 2.5 years
Round 0: Online Assessment
Standard coding assessment with DSA questions. Difficulty level was around LeetCode Medium.
Round 1: Technical Interview
- Resume Discussion
The interviewer started with a detailed walkthrough of my resume and projects. - System Design (HLD)
- Design Flash Sale System
Single product and sale starts at a particular time. Low latency and consistency over availability
- Design Flash Sale System
- DSA Questions
Q1. Bottle Recycling / Perk Maximization
You are given:
numBottles(initial number of bottles)dollars(initial money)- Each bottle can be recycled for
recycleVal - You can buy a perk using 1 bottle + perkVal dollars
Find the maximum number of perks you can obtain.
Q2. Substring Problem
Find the maximum number of non-overlapping substrings of a string such that:
- Each substring length is at least
k - Print the substrings.
Round 2: Technical Interview
Q1. One coding question (LeetCode Medium). I don’t remember the exact problem.
Q2.
Partition Array Into Two Arrays to Minimize Sum Difference
Round 3: Hiring Manager Round
- Behavioral questions about previous projects
- Deep dive into my experience at Oracle
- Questions around problem solving approach, ownership, and collaboration
- Some resume-based technical discussion
Final Result
Status: Hired
Find the compensation details here
Interview Questions (4)
Design Flash Sale System
Design a flash sale system for a single product. The sale starts at a particular time. The system should prioritize low latency and consistency over availability.
Bottle Recycling / Perk Maximization
You are given: numBottles (initial number of bottles), dollars (initial money). Each bottle can be recycled for recycleVal. You can buy a perk using 1 bottle + perkVal dollars. Find the maximum number of perks you can obtain.
Maximum Non-Overlapping Substrings with Min Length K
Find the maximum number of non-overlapping substrings of a string such that: Each substring length is at least k. Print the substrings.