Salesforce - MTS - Interview Experience ( Rejected )
Summary
I attempted two medium LeetCode problems in the DS&A round but was not progressed further.
Full Experience
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
Interview Questions (2)
Maximal Square
Given a 2D binary matrix filled with '0's and '1's, find the largest square containing only '1's and return its area.
Longest Increasing Subsequence
Given an integer array, determine the length of the longest strictly increasing subsequence.