Software Engineer SMTS
Minimum Deletions for Almost Sorted Array
Given an array of integers, calculate the minimum number of deletions required to make the array 'almost sorted'. This problem can be approached using Dynamic Programming.
This question was asked in
Salesforce Software Engineer SMTS Interview Experience
The Salesforce interview process consisted of five rounds, which included coding challenges in Round 1 focused on dynamic programming and grid traversal, followed by more problem-solving questions in Round 2. Rounds 3 and 4 concentrated on system design, covering topics such as a library management system and Google Drive architecture, while the final round with the hiring manager focused on behavioral and managerial aspects. Overall, the difficulty level of the interview experience at Salesforce was moderate to challenging, requiring both technical and interpersonal skills.