salesforce logo
Salesforce· MTS I

Salesforce | MTS | OA | problem 2025

Result
No Offer
Experience
2 years
Posted
10 May 2025
446 reads

Summary

I recently participated in an Online Assessment for a MTS role at Salesforce, which involved solving two coding problems. I've detailed one of these problems, including multiple approaches and their time complexities.

How it went

I applied for a MTS position at Salesforce and received a referral, which led me to the interview process. The first stage was a technical online assessment, where I had to solve two coding problems. I'm providing a detailed account of the second problem I encountered, along with different code implementations and a discussion of their complexities. Following the OA, there was a second round, which was a standard interview. That concludes my experience with the process.

Questions asked (1)

  1. 01

    Count Stable Segments

    Data Structures & Algorithms · Medium

    Given an integer array named capacity, I was asked to find the number of 'stable segments'. A segment [i, j] is defined as stable if the following conditions are met:

    • The segment must have at least three elements, meaning j >= i + 2.
    • The value at the start of the segment, capacity[i], must be equal to the value at the end of the segment, capacity[j].
    • Both capacity[i] and capacity[j] must be equal to the sum of all elements strictly between indices i and j (i.e., sum(capacity[k]) for all k where i < k < j).
    I was asked to provide the most optimized code for this problem and was expected to pass 75-80% of the test cases, with a few test cases hidden.

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!