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
Docquity Holdings (PBS) Interview Experience | SDE-1(Entry level)
Summary
I applied for an SDE-1 position at Docquity Holdings and went through a multi-round interview process. The process included online assessments, technical interviews, and a final round with a senior member. Despite performing well in most rounds, I was not selected for the final HR round.
Full Experience
As a student from J.C. Bose University of Science and Technology, I applied for an SDE-1 role at Docquity Holdings. The process started with an online MCQ round covering core CS topics, which I cleared. I then moved to an online assessment where I solved two DSA problems, including a variation of the Minimum Path Sum and a Cycle Detection in Linked List problem. The next rounds were technical interviews with senior developers and the head of the technical team, covering a range of topics from OOPs to system design. The final round was a mix of technical and personal discussions. While I performed well in most rounds, I didn't make it to the HR round.
Interview Questions (5)
Solve a problem similar to the LeetCode Minimum Path Sum problem. The task is to find the minimum path sum in a grid, where each cell represents a value and you can move only right or down.
Write a function to detect and print a cycle in a given linked list. The task requires identifying the loop and then printing the nodes that form the cycle.
Given a list of intervals, merge overlapping intervals. The task is to return a list of non-overlapping intervals sorted by their start times.
Implement a min-heap data structure from scratch. The task includes writing the necessary functions to insert elements and extract the minimum value.
Given a linked list, create a new linked list where the nodes are arranged in an alternate manner. The task is to achieve this in O(1) space complexity.
Preparation Tips
For the interview process, I focused on strengthening my core CS fundamentals, especially in Operating Systems, Databases, and Computer Networks. I practiced solving DSA problems, including variations of the Minimum Path Sum and Cycle Detection in Linked List. I also reviewed OOPs concepts, SQL queries, and system design principles to ensure I was well-prepared for the technical rounds.