Salesforce·Software Engineer·Technical Phone Screen
May 2026
Salesforce software engineer coding round, pretty much one big linked list problem with multiple variants. They wanted full solutions, complexity analysis, and edge case tests all in one go, which felt like a lot to juggle in real time.
- Given a singly linked list, remove duplicate values in-place. For a sorted list, delete repeated nodes so each value appears once using O(1) extra space. For an unsorted list, preserve the first occurrence of each value and provide two solutions: one using a hash set and one using the runner technique without extra memory. Define your ListNode type, explain correctness, analyze time and space complexity for each approach, and include tests for edge cases like empty list, single node, all duplicates, and no duplicates.
“This was way more layered than I expected for what sounded like a warmup question.” 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