Salesforce - MTS - Interview Experience ( Rejected )
- Experience
- 4 years
- Posted
- 22 Jul 2026
Summary
I attempted two medium LeetCode problems in the DS&A round but was not progressed further.
How it went
Experience: 4 YOE
Round 1: Data Structures & Algorithms
Two LeetCode medium questions. https://leetcode.com/problems/maximal-square/description/ https://leetcode.com/problems/longest-increasing-subsequence/description/
Gave bruteforce and optimial approach for both questions Solved both within the time limit and walked through my approach and complexity before/while coding.
Both solutions compiled successfully (Hackerrank IDE was shared) and passed the provided test cases.
Result: Did not move forward to the next round. I'm honestly not sure what tipped it.
Life!! Cheers
Questions asked (2)
- 01
Maximal Square
Data Structures & Algorithms · Medium
Open the problemGiven a 2D binary matrix filled with '0's and '1's, find the largest square containing only '1's and return its area.
- 02
Longest Increasing Subsequence
Data Structures & Algorithms · Medium
Open the problemGiven an integer array, determine the length of the longest strictly increasing subsequence.