Salesforce | SMTS | Interview Experience
- Result
- Ongoing
- Experience
- 7.5 years
- Posted
- 6 Nov 2025
Summary
I recently interviewed at Salesforce for an SMTS Backend role, successfully navigating a HackerRank coding assessment and a virtual DSA round. While I solved most of the problems, I ran out of time implementing the optimal solution for a challenging design question.
How it went
I was approached by a recruiter for the SMTS Backend role at Salesforce, which led to an interview process comprising two main rounds.
Round 1: Platform - HackerRank
This round consisted of two coding questions, to be completed within 75 minutes. The first question was a variant of Remove Duplicates from Unsorted Linked List, requiring me to ensure only a single occurrence of numbers. The second was a variant of Kth Largest Element in an Array. I managed to solve both problems efficiently within 40 minutes.
Round 2: Virtual DSA Coding Round
This round also presented two questions, with a 60-minute time limit. The first question was a variant of Reconstruct Itinerary, simplified by the constraint that the input would not contain any loops or multiple paths. I solved this problem using a hashmap and a set in approximately 30 minutes, and the interviewer seemed satisfied with my approach.
The second question was to design a Queue with an O(1) getMax() operation. I initially considered using a queue combined with a monotonic increasing stack, but while coding, I realized a monotonic deque, similar to the technique used in the Sliding Window Maximum problem, would be a more suitable approach. Unfortunately, I was unable to complete the deque solution within the remaining 30 minutes.
Questions asked (4)
- 01
Remove Duplicates from Unsorted Linked List (Variant)
Data Structures & Algorithms · Medium
Open the problemA variant of the standard 'Remove Duplicates from an Unsorted Linked List' problem, where the requirement is to ensure only a single occurrence of each number in the linked list.
- 02
Kth Largest Element in an Array (Variant)
Data Structures & Algorithms · Medium
Open the problemA variant of the problem 'Kth Largest Element in an Array'.
- 03
Reconstruct Itinerary (Variant without Loops/Multiple Paths)
Data Structures & Algorithms · Hard
Open the problemA variant of the 'Reconstruct Itinerary' problem. The key difference is that the input will not contain any loops or multiple paths, simplifying the problem considerably.
- 04
Design Queue with O(1) getMax()
Data Structures & Algorithms · Medium
Design a queue data structure that supports a getMax() operation, which returns the maximum element currently in the queue in O(1) time complexity. The standard queue operations (enqueue, dequeue) should also be efficient.