Salesforce Interview Experience
Summary
Applied for Salesforce interview on 1st November 2025. Faced a challenging DSA round with a problem involving array operations and maximum subarray sum. Could not solve it and was rejected.
Full Experience
Experince: 7 years
Current: Prduct Based Compnay (36 + 5.5 + 4.5 (LTI)) - ~46 LPA
Offer in Hand: Walmart: 45 + 8.7 + 3.5(stocks) = ~57 LPA
Kotak Mahindra: 49 + 7.5 + 4.5(LTI) = ~ 60 LPA
I was part of salesforce hiring drive today i.e. 1st November 2025
Round -1 DSA:
find the maximum subarray sum of array1 after applying m operations from arr2: condition for operation:
1. you can choose one element from arr2 either from front or either from back and put it in array 1 either at back or front.
2. you have to delete element that you pick from array 2.
3. after adding element to array1, now you need to find the maximum subarray sum of array 1.
you can perform above opertions m times where m is the size of array 2
e.g. array1 ={1,3,-5,2,2} array2 = {2,3}
o/p = 2,2,2,3 = 9 when you put but the elements of array 2 at the end of array 1.
Not able to solve it.
Solution is highly appreciated but not the chatGpt/Claude/deepseek
Result: Rejected
Anyone have idea what's the difficulty : medium or hard.
Interview Questions (1)
Find the maximum subarray sum of array1 after applying m operations from arr2. Each operation allows choosing an element from arr2 (either front or back) and placing it in array1 (either at the front or back). After each operation, the chosen element is deleted from arr2. The operations can be performed m times, where m is the size of array2.