# Salesforce MTS Interview Experience
- Posted
- 5 Apr 2026
Summary
I interviewed for an MTS role at Salesforce, completing an online assessment followed by a low‑level design round and a DSA round with two coding problems.
How it went
I was reached out to by a recruiter from Salesforce at the end of January 2026 for MTS role. The process started with an Online Assessment, followed by technical rounds.
Round 1: (LLD based) Resume Discussion The interviewer started with a walkthrough of my resume and projects.
LLD Question: Design a component that logs the state transitions of workflow steps. Each workflow consists of multiple steps with defined states (e.g., Pending, Running , Completed/Failed) Need to track and persist state changes over time .
Round 2: (DSA Round) Question 1: Task Scheduling with Constraints Given: array of task types, array of memory required for each task and server memory limit Constraints: At most 2 tasks of the same type can run in parallel Total memory of running tasks ≤ server limit Goal: Find minimum time to execute all tasks
type = [A, A, A, B, B, C] memory = [2, 2, 3, 4, 1, 2] M = 5 output: 3
Question 2 : Grid with K Jumps (BFS) Given a mxn grid with obstacles, allowed to move in 4 directions(left, right, up, bottom) and can jump 1 to K cells Find minimum steps to reach destination when you are given the src and destination.
Questions asked (3)
- 01
Design Component for Logging Workflow State Transitions
System Design
Design a component that logs the state transitions of workflow steps. Each workflow consists of multiple steps with defined states (e.g., Pending, Running, Completed/Failed). Need to track and persist state changes over time.
- 02
Task Scheduling with Memory and Type Constraints
Data Structures & Algorithms
Given an array of task types and an array of memory required for each task, along with a server memory limit M, schedule the tasks such that at most two tasks of the same type run in parallel and the total memory of running tasks does not exceed M. Find the minimum time to execute all tasks.
Example: type = [A, A, A, B, B, C] memory = [2, 2, 3, 4, 1, 2] M = 5 output: 3
- 03
Grid Minimum Steps with K-Jump Moves
Data Structures & Algorithms
Given an m×n grid with obstacles, you can move in the four cardinal directions and can also jump 1 to K cells in any direction. Find the minimum number of steps to reach the destination from a given source.
Input includes the grid, the source, the destination, and the jump limit K.