Salesforce SMTS | Dec 23 | India[Offer]

I had online interviews for a SMTS position at Salesforce in December .

The online assessment consisted of two medium difficulty coding questions on HackerRank, which I was able to solve within the 60-minute time limit.

The onsite round consisted of three technical rounds and a hiring manager round.

In the first technical round, I was asked to solve the LeetCode problem "Pow(x, n)". I initially provided a linear complexity solution, but was then asked to optimize it. There were several follow-up questions about the time complexity of the optimized solution. I was also asked to solve the LeetCode problem "Populating Next Right Pointers in Each Node", with a follow-up question about a constant space solution.

In the second technical round, I was asked to solve the LeetCode problem "Count the Number of Infection Sequences". I was also asked a dynamic programming problem that I cannot recall at this time.

In the third technical round, I was asked to design a system that stores employee and dependent information. The system should be able to return the entire family's data when provided with an employee ID or a dependent ID.

The next day, I had a hiring manager round. We discussed my previous projects in detail, and I was asked some general behavioral questions. The hiring manager also asked why I was leaving my current company, and we discussed this for about five minutes.

I received an offer approximately ten days later.