Salesforce·Software Engineer·Technical Phone Screen
May 2026
Salesforce SWE interview focused on linked list manipulation, specifically around removing duplicates. The question had multiple layers to it depending on whether the list was sorted or not, and they pushed into a harder variant at the end.
- Given the head of a singly linked list, remove duplicate nodes so each value appears at most once. How would your approach differ if the list is unsorted versus sorted?
- What if instead of keeping one copy of each duplicate, you had to remove ALL nodes that appear more than once?
“The sorted case is pretty clean, single pass, O(n) time and constant space, just compare each node to the next and skip.” The rest of the author's notes on Software Engineer interview at Salesforce, Technical Phone Screen round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.
View Post