Salseforce MTS interview experience
Summary
I went through Salesforce's MTS interview process, including an online assessment, a virtual technical interview, and three onsite technical rounds, and I was selected.
Full Experience
Applied through a referral. 3 YOE - working as a FE at a E-commerce company
Round 0 - Online Assessment: There were 2 DSA problems. I do not remember the exact questions.
Round 1 - Virtual Technical Interview: They asked me to implement LRU Cache and LFU Cache. I was able to solve both with working running solutions.
After that, I got shortlisted for onsite interviews. There were 3 rounds on the same day.
Round 2 - Onsite Technical: One question was based on the Sliding Window technique. The problem statement was long and story-based, but the final approach was sliding window. Then i was asked an LCA (Lowest Common Ancestor) problem.
Round 3 - Onsite Technical: Number of Islands Median in a Data Stream Trie - only logic and discussion, no coding implementationafter explaination we had more time left, then iw as asked some more followup question on trie, implement autosuggest using trie show only 3 reponse, time and space taken.
Round 4 - Hiring Manager Round: The discussion was mainly around my projects and the work I have done. They asked deep follow-up questions on my projects. They also asked: What I like about my current company Why I want to leave my current company What I know about Salesforce
Verdict: Selected.
Interview Questions (6)
LRU Cache
Implement an LRU (Least Recently Used) Cache supporting get and put operations with O(1) time complexity.
LFU Cache
Implement an LFU (Least Frequently Used) Cache supporting get and put operations.
Lowest Common Ancestor of a Binary Tree
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.
Number of Islands
Given a 2D grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically.
Find Median from Data Stream
Design a data structure that supports adding numbers from a data stream and finding the median of all elements added so far.
Trie Autosuggest
Design and implement an autosuggest feature using a Trie that returns the top 3 suggestions for a given prefix, including analysis of time and space complexity.