Docusign coding interview
questions, leaked.
34 problems reported across recent Docusign interviews. Top patterns: array, hash table, sorting. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Docusign's coding interview leans heavily on arrays and hash tables. Out of 34 problems reported, 16 involve arrays and 14 involve hash tables. You're looking at 26 medium-difficulty problems, 5 hard, and only 3 easy ones. Most candidates will see Merge Intervals, Top K Frequent Elements, or Implement Trie. The pattern is clear: you need to be solid on data structure manipulation and retrieval fast. If you hit a wall on a hash-table problem mid-assessment, StealthCoder runs invisibly during screen share and surfaces a working solution in seconds, invisible to the proctor.
Top problems at Docusign
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Implement Trie (Prefix Tree) | MEDIUM | 100.0 | 68% | Hash Table · String · Design |
| 02 | Copy List with Random Pointer | MEDIUM | 95.8 | 61% | Hash Table · Linked List |
| 03 | Merge Intervals | MEDIUM | 84.8 | 49% | Array · Sorting |
| 04 | Rotting Oranges | MEDIUM | 84.8 | 57% | Array · Breadth-First Search · Matrix |
| 05 | Design Authentication Manager | MEDIUM | 84.8 | 58% | Hash Table · Linked List · Design |
| 06 | Top K Frequent Elements | MEDIUM | 84.8 | 65% | Array · Hash Table · Divide and Conquer |
| 07 | Integer to Roman | MEDIUM | 77.0 | 69% | Hash Table · Math · String |
| 08 | Search Suggestions System | MEDIUM | 77.0 | 65% | Array · String · Binary Search |
| 09 | Longest Substring Without Repeating Characters | MEDIUM | 77.0 | 37% | Hash Table · String · Sliding Window |
| 10 | Sort Colors | MEDIUM | 77.0 | 68% | Array · Two Pointers · Sorting |
| 11 | Find Median from Data Stream | HARD | 77.0 | 53% | Two Pointers · Design · Sorting |
| 12 | Reaching Points | HARD | 77.0 | 34% | Math |
| 13 | Excel Sheet Column Number | EASY | 77.0 | 66% | Math · String |
| 14 | Meeting Rooms II | MEDIUM | 66.0 | 52% | Array · Two Pointers · Greedy |
| 15 | Number of Atoms | HARD | 66.0 | 65% | Hash Table · String · Stack |
| 16 | House Robber II | MEDIUM | 66.0 | 44% | Array · Dynamic Programming |
| 17 | Two Sum | EASY | 66.0 | 56% | Array · Hash Table |
| 18 | Shortest Bridge | MEDIUM | 66.0 | 59% | Array · Depth-First Search · Breadth-First Search |
| 19 | Inorder Successor in BST | MEDIUM | 66.0 | 51% | Tree · Depth-First Search · Binary Search Tree |
| 20 | Reorder Routes to Make All Paths Lead to the City Zero | MEDIUM | 66.0 | 65% | Depth-First Search · Breadth-First Search · Graph |
| 21 | Boats to Save People | MEDIUM | 66.0 | 60% | Array · Two Pointers · Greedy |
| 22 | Palindrome Permutation | EASY | 66.0 | 69% | Hash Table · String · Bit Manipulation |
| 23 | IPO | HARD | 66.0 | 53% | Array · Greedy · Sorting |
| 24 | Optimal Partition of String | MEDIUM | 66.0 | 78% | Hash Table · String · Greedy |
| 25 | Product of Array Except Self | MEDIUM | 66.0 | 68% | Array · Prefix Sum |
| 26 | Clone Graph | MEDIUM | 66.0 | 62% | Hash Table · Depth-First Search · Breadth-First Search |
| 27 | 3Sum | MEDIUM | 66.0 | 37% | Array · Two Pointers · Sorting |
| 28 | Insert Delete GetRandom O(1) | MEDIUM | 66.0 | 55% | Array · Hash Table · Math |
| 29 | Pairs of Songs With Total Durations Divisible by 60 | MEDIUM | 66.0 | 53% | Array · Hash Table · Counting |
| 30 | Design Add and Search Words Data Structure | MEDIUM | 66.0 | 47% | String · Depth-First Search · Design |
| 31 | Count Good Nodes in Binary Tree | MEDIUM | 66.0 | 73% | Tree · Depth-First Search · Breadth-First Search |
| 32 | Number of Islands | MEDIUM | 66.0 | 62% | Array · Depth-First Search · Breadth-First Search |
| 33 | LRU Cache | MEDIUM | 66.0 | 45% | Hash Table · Linked List · Design |
| 34 | Merge k Sorted Lists | HARD | 66.0 | 57% | Linked List · Divide and Conquer · Heap (Priority Queue) |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Docusign OA. The proctor cannot see it. Screen share cannot detect it. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE.
Get StealthCoder- array16 · 47%
- hash table14 · 41%
- sorting10 · 29%
- string9 · 26%
- depth first search7 · 21%
- heap priority queue6 · 18%
- design6 · 18%
- breadth first search6 · 18%
- two pointers5 · 15%
- greedy4 · 12%
The topic distribution reveals what Docusign actually cares about. Arrays and hash tables combined cover half the interview. Sorting (10 problems) and string manipulation (9 problems) are next tier. Design questions are real here, not theoretical. Look at Implement Trie, Design Authentication Manager, and Find Median from Data Stream. These aren't just "implement a thing." They test whether you can structure code under pressure. Depth-first search and breadth-first search show up in 7 and 6 problems respectively, so tree and graph traversal matters but won't dominate your session. Two-pointers appears in 5 problems, often paired with sorting. The hard problems (math-heavy like Reaching Points, or stack-heavy like Number of Atoms) are the real hedge case. Most candidates won't solve these clean. StealthCoder is your backup when the pattern isn't obvious and time's running thin.
Companies with similar patterns
If you prepped for Docusign, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Docusign.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Docusign interview FAQ
What should I drill first for Docusign?+
Arrays and hash tables. 16 array problems and 14 hash-table problems means they're almost half the interview. Start with Merge Intervals, Top K Frequent Elements, and Longest Substring Without Repeating Characters. Get comfortable iterating, hashing, and combining both patterns. Sorting is tight second.
How many design problems will I see?+
Six design-tagged problems in the list, including Implement Trie, Design Authentication Manager, and Find Median from Data Stream. Expect one per interview. These test code structure, not just algorithm knowledge. Practice writing clean, extendable class hierarchies under time pressure.
Is two-pointers enough of a focus?+
It appears in 5 problems and usually pairs with sorting (Merge Intervals, Sort Colors, Meeting Rooms II). Don't skip it, but don't spend a full day on it. It's a supporting technique you'll use when you already know the main pattern. Sorting is the prerequisite.
Should I study hard problems before the interview?+
Knowing the math trick for Reaching Points or the stack approach for Number of Atoms won't happen in prep. They're 5 out of 34 total problems. If you nail the medium-difficulty hash table and array stuff, you'll pass. Hard problems are where StealthCoder covers you if you get unlucky and draw one.
Are string and tree problems worth equal study time?+
No. String shows up in 9 problems (Implement Trie, Integer to Roman, Search Suggestions System, Longest Substring Without Repeating Characters). Depth-first search and breadth-first search combined are 13 problems. String is real. Trees and graphs are slightly higher volume, so prioritize those if you're short on time.