Docquity Holdings (PBS) Interview Experience | SDE-1(Entry level)

Result
No Offer
Location
Faridabad
Posted
19 Aug 2025
270 reads

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.

How it went

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.

Questions asked (5)

  1. 01

    Minimum Path Sum Variation

    Data Structures & Algorithms · Medium

    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.

  2. 02

    Cycle Detection in Linked List

    Data Structures & Algorithms · Medium

    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.

  3. 03

    Merge Intervals Problem

    Data Structures & Algorithms · Medium

    Given a list of intervals, merge overlapping intervals. The task is to return a list of non-overlapping intervals sorted by their start times.

  4. 04

    Min Heap Implementation

    Data Structures & Algorithms · Medium

    Implement a min-heap data structure from scratch. The task includes writing the necessary functions to insert elements and extract the minimum value.

  5. 05

    Alternate Node Representation in Linked List

    Data Structures & Algorithms · Hard

    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.

How they prepared

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.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Docquity Holdings recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!