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
DocuSign Software Engineer Internship - Summer 2025
Summary
I interviewed for a Software Engineer Internship position at DocuSign for Summer 2025. The process included a Hackerrank Online Assessment with two specific coding problems, followed by two interview rounds focused on algorithmic problems, projects, and behavioral questions.
Full Experience
Compensation : 1.2 lpm
Type : On-site
Hackerrank OA :
- Given total no of wheels $$n$$, determine how many distinct combinations of 4 wheeler and 2 wheeler vehicles can be formed.
- SQL qsn based on joins
- Given a grid with empty and blocked cells, find path which maximizes the minimum distance to a blocked cell from cells of the path and return the maximized minimum distance.
Interview Round 1 :
- Given an array $$arr$$, find no of distinct ways to partition the array into 3 consecutive non-empty subarrays such that : S2<=S1+S3
S1 = sum of 1st subarray (left)
S2 = sum of 2nd subarray (center)
S3 = sum of 3rd subarray (right) - Given an array $$transactions$$, find longest subsequence of transactions such that when performed in order (summation) the amount in your account never goes negative.
Interview Round 2 :
- Based on projects and behavioral qsns
Interview Questions (4)
Given total no of wheels $$n$$, determine how many distinct combinations of 4 wheeler and 2 wheeler vehicles can be formed.
Given a grid with empty and blocked cells, find path which maximizes the minimum distance to a blocked cell from cells of the path and return the maximized minimum distance.
Given an array $$arr$$, find no of distinct ways to partition the array into 3 consecutive non-empty subarrays such that : S2<=S1+S3
S1 = sum of 1st subarray (left)
S2 = sum of 2nd subarray (center)
S3 = sum of 3rd subarray (right)
Given an array $$transactions$$, find longest subsequence of transactions such that when performed in order (summation) the amount in your account never goes negative.