All experiences
Offered2026-08-23·3 min read

Salesforce MTS — 3 Rounds, Selected

Applied with referral. OA + 3 rounds on same day. DSA fundamentals, system design, and HM deep dive. Got offer in 38 days from application. TC: ~41.6L (27.4L base + stock + bonus).

Company

Salesforce

Role

MTS (Member of Technical Staff)

Rounds

3

YOE

3

Timeline

  • Day 0: Applied through portal with referral
  • Day 3: Recruiter shared online assessment (1 week to complete)
  • Day 4: Completed OA
  • Day 11: Shortlisted for interviews
  • Day 21: All 3 rounds on same day
  • Day 28: Recruiter confirmed positive feedback, proceeding with offer
  • Day 38: Received and accepted offer

Background

  • 3.2 YOE at a product-based company
  • NIT graduate
  • Previous CTC: 28.5L (17.5L base + 11L variable)

Online Assessment

Standard HackerRank-style OA. Medium difficulty DSA questions. Had a week to complete but did it next day.

Round 1 — DSA (60 min)

Q1: Top K Frequent Numbers from Continuous Stream

  • Design a data structure supporting add(num) and topK(k)
  • Infinite stream, operations in any order
  • Used HashMap for frequency + Min-Heap of size K
  • Discussed trade-offs with bucket sort approach

Q2: Convert Sorted Doubly Linked List to Balanced BST (In-Place)

  • No new nodes allowed — reuse existing DLL node pointers
  • prev → left child, next → right child
  • Used divide-and-conquer: find middle, recurse on halves

Verdict: Positive

Round 2 — DSA (60 min)

Was originally supposed to be LLD but ended up being DSA.

Q1: Implement Merge Sort from Scratch

  • Full implementation + discussed:
    • Recursion tree and depth
    • Time complexity proof (O(n log n))
    • Space complexity (O(n) for merge step)
    • Optimizations (insertion sort for small subarrays, natural merge sort)

Q2: Count Set Bits in an Integer

  • Used repeated right shift + check LSB
  • Discussed Brian Kernighan's algorithm (n & (n-1)) as optimization
  • Discussed lookup table approach for O(1)

Q3: Find All Anagrams in a String

  • Sliding window with frequency map comparison
  • Optimized with matchCount variable for O(n) time

Verdict: Positive

Round 3 — System Design + HM (60 min)

First half: Project deep dive

  • Architectural decisions in current role
  • Production challenges and how I resolved them
  • Trade-offs I made and why
  • Customer impact and ownership
  • Cross-team collaboration examples

Behavioral questions:

  • Why looking for a change
  • Career goals and mentoring experience
  • Handling disagreements
  • Driving initiatives independently

Second half: HLD — Design a Payment Processing Platform

  • Started with high-level architecture
  • Deep dived into: request flow, scalability, reliability, consistency, idempotency, failure handling, retry mechanisms, DB choices, monitoring
  • Most follow-ups came from design trade-offs and non-functional requirements

Verdict: Positive

The Offer

  • Base: ₹27.4L
  • Stock: $48.1K USD over 4 years (~₹10L/yr)
  • Bonus: 10% of base (~₹2.7L)
  • Total CTC: ~₹41.6L

Previous CTC was ₹28.5L — roughly 46% jump.

Tips for Salesforce MTS

  1. DSA is fundamental-focused — they're not asking LC Hard tricks. Expect merge sort from scratch, heap design, classic sliding window. But you need to implement cleanly and discuss complexity deeply.
  2. System design is practical — payment systems, messaging platforms, real-world services. Focus on reliability, idempotency, and failure handling.
  3. Project deep dive is serious — know your production systems intimately. They'll ask "why this DB? why this pattern? what broke in production?"
  4. All rounds in one day — be mentally prepared for 3+ hours of continuous interviewing. Stay energized.
  5. Referral helps speed — recruiter reached out within 3 days of referred application.
  6. OA is a filter, not the bar — don't overthink it. Medium difficulty, just pass it quickly.

Join 500+ engineers

Weekly interview questions + comp data insights. No spam. Unsubscribe anytime.

Powered by Substack. Your email is safe.