Salesforce LMTS Online Interview Round | November 2025

salesforce logo
salesforce
MTS IIIRejected
December 1, 2025134 reads

Summary

I had an online interview with Salesforce for an LMTS role where I was asked two coding problems. I solved one completely and had a partial solution for the second, but unfortunately, I was rejected because they expected both solutions to be fully working.

Full Experience

I recently interviewed online with Salesforce for an LMTS position. The round consisted of two coding questions, to be completed within an hour. I successfully solved the first problem, "Number of Islands." For the second problem, "House Robber II," I managed to come up with a partial dynamic programming solution, but I ran out of time before completing it. Ultimately, I received a rejection as the team expected a fully working solution for both problems.

Interview Questions (2)

Q1
Number of Islands
Data Structures & AlgorithmsMedium

Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.

Q2
House Robber II
Data Structures & AlgorithmsMedium

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have security systems connected, and it will automatically contact the police if two adjacent houses were broken into on the same night. Given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!