Microsoft SDE Intern Interview Experience
💼 LTIMindtree Interview Experience (On-Campus) | Fresher | 2026
Salesforce SMTS | Interview Experience | Rejected
JPMC | SDE2 (Associate) - Java Backend - Interview Experience + Compensation
Microsoft - SDE2 - Coding Round
IBM (OA)
Summary
I participated in an IBM Online Assessment where I encountered two algorithm problems, 'Maximize Decryption Value' and 'Maximum Distinct Split Sum'. I was unable to solve them efficiently due to time complexity issues.
Full Experience
There are two questions:
1.LeetCode 239 helps with sliding-window strategies
Actual Question: Maximize Decryption Value (LC)
2.LeetCode 410 helps with partitioning logic if adapted for distinct counts
Actual Question: Maximum Distinct Split Sum
These are not exactly the same questions, but they seem similar in concept.
And I just solved 0 of them because I failed due to time complexity in one problem
Interview Questions (2)
The actual question was 'Maximize Decryption Value'. The author noted that LeetCode 239 (Sliding Window Maximum) provides useful strategies for this type of problem, suggesting it involves sliding window techniques.
The actual question was 'Maximum Distinct Split Sum'. The author noted that LeetCode 410 (Split Array Largest Sum) provides useful partitioning logic when adapted for distinct counts, suggesting it involves partitioning and possibly dynamic programming or binary search on the answer.