DocuSign Software Engineer Blitz Interview Experience
Interview Experience
📋 Interview Overview -
Interview Mode: Blitz(Fast paced) -
Company: DocuSign -
Position: Software Engineer -
Total Rounds: 2 (Both Coding + DSA) -
Platform: Zoom (Meeting) + Hac
Full Details
📋 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 ⚠️ --- #DocuSign #InterviewExperience #SDE #CodingInterview #DSA #Rejected
About This Question
This is a candidate experience report from a docusign interview for a swe role during the coding round reported in 2026.
It covers the following topics: Arrays, Binary Search, Greedy, Hash Table .
Topics
About Docusign Interview Reports
This question was reported by a candidate who interviewed at Docusign. LeakCode aggregates interview reports from 10+ sources, including 1Point3Acres, Glassdoor, LeetCode Discuss, Blind, Reddit, Indeed, and Nowcoder. Each report is translated where necessary, deduplicated against existing entries, and tagged by company, role, round type, and reporting date.
Use this question as one calibration data point, not a memorization target. Companies typically rotate their question pools every 2-4 months; the exact wording of a 2024 question may differ from what you encounter today. The underlying pattern, difficulty level, and follow-up depth at Docusign are the higher-signal extractions to take from this report.
For broader preparation context, the Docusign interview process typically includes a recruiter screen, one or two technical phone screens, and a 4-5 round on-site loop covering coding, system design (at L4+ levels), and behavioral. Reports tagged on LeakCode show the round-by-round distribution and typical difficulty calibration. To browse questions filtered by round type and seniority, use the company hub linked above.
How To Practice This Type of Question
Solve similar problems on LeetCode under timed conditions (25-35 minutes per medium difficulty). The goal is pattern recognition: recognize the underlying technique (sliding window, two-pointer, BFS, memoized recursion, etc.) within 60-90 seconds of reading. Strong candidates verbalize their hypothesis out loud before coding, then iterate based on feedback. Weak candidates dive into implementation immediately, lose time on the wrong approach, and run out of time for follow-ups.
Companies update their question pools every 2-4 months. The exact wording of any given question may have been retired by the time you interview. Focus your prep on the pattern, not the specific problem. The patterns that appear in Docusign reports consistently are the ones worth investing in; one-off niche problems are not.
During Your Docusign Round
Apply the standard interview round template: clarify requirements (2-3 minutes), state your approach out loud and confirm direction with the interviewer (3-5 minutes), code with narration (15-25 minutes), test with concrete examples including edge cases (5 minutes), discuss optimization or trade-offs if time permits (5 minutes). This template is universally accepted across FAANG and adjacent companies; deviating from it produces weaker interviewer feedback signal.
The single most predictive failure mode in Docusign reports tagged "no hire": not asking clarifying questions. Interviewers are explicitly trained to weight this. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's written notes.