docusign logo
Docusign· Software Engineer

DocuSign Interview Experience(Blitz) | Software Engineer | 2 Rounds | Rejected ❌

Posted
13 Feb 2026
425 reads

Summary

I interviewed for a Software Engineer position at DocuSign in a fast-paced Blitz mode, consisting of two coding rounds. I was rejected after successfully clearing the first round but struggled significantly with the second due to implementation issues.

How it went

📋 Interview Overview

  • Interview Mode: Blitz(Fast paced)
  • Company: DocuSign
  • Position: Software Engineer
  • Total Rounds: 2 (Both Coding + DSA)
  • Platform: Zoom (Meeting) + HackerEarth (DSA)
  • Result: ❌ Rejected
  • My Background: Dev-focused guy with no DSA experience :)

🔴 Round 1: Array Manipulation

Problem: Merge Two Sorted Arrays

Question: Standard merge two sorted arrays problem

My Approach:

  • Explained the naive approach first
  • Then implemented the solution

Follow-up Question:

"What if array size is big but the elements are from a small group?"

My Answer: Binary Search

Result: Round 1 cleared ✅


🔴 Round 2: Meeting Scheduling (Greedy/Interval Problem)

Problem Statement

A startup owner wants to schedule meetings with investors. There are n investors available.

Given:

  • firstDay[n] - First day when investor i is available
  • lastDay[n] - Last day when investor i is available

Constraint: Only one meeting per day allowed

Goal: Return the maximum number of meetings the owner can schedule

Example

Input:
firstDay = [1, 1, 2, 3]
lastDay  = [1, 2, 2, 3]

Output: 3

Explanation:
Day 1 → Available: Investor 1, 2 → Meet Investor 1
Day 2 → Available: Investor 2, 3 → Meet Investor 2
Day 3 → Available: Investor 4 → Meet Investor 4

Total meetings = 3

My Approach

Initial Thinking (15 mins):

  • Use a HashMap to store all available investors for each day
  • Use a HashSet to track investors already met

Implementation Issues:

  • Logic was mostly correct
  • Struggled with Java syntax (haven't done DSA in Java for years)
  • Spent time fixing syntax errors
  • Test Results: 4/20 passed ⚠️

Questions asked (3)

  1. 01

    Merge Two Sorted Arrays

    Data Structures & Algorithms

    Standard merge two sorted arrays problem

  2. 02

    Merge Two Sorted Arrays with Limited Element Range

    Data Structures & Algorithms

    What if array size is big but the elements are from a small group?

  3. 03

    Maximum Number of Meetings (Greedy/Interval)

    Data Structures & Algorithms

    A startup owner wants to schedule meetings with investors. There are n investors available.

    Given:

    • firstDay[n] - First day when investor i is available
    • lastDay[n] - Last day when investor i is available

    Constraint: Only one meeting per day allowed

    Goal: Return the maximum number of meetings the owner can schedule

    Example

    Input:
    firstDay = [1, 1, 2, 3]
    lastDay  = [1, 2, 2, 3]
    
    Output: 3
    
    Explanation:
    Day 1 → Available: Investor 1, 2 → Meet Investor 1
    Day 2 → Available: Investor 2, 3 → Meet Investor 2
    Day 3 → Available: Investor 4 → Meet Investor 4
    
    Total meetings = 3
    

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Docusign 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!