Problem database last updated: June 20, 2025
31 problems · 2 Easy, 24 Medium, 5 Hard · Ranked #60 of 458
2 Easy
6% · avg 23%
24 Medium
77% · avg 59%
5 Hard
16% · avg 18%
Based on 31 reported problems, Docusign interviews are in line with industry averages - 16% Hard vs 18% overall. The majority (77%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Docusign puts unusual emphasis on trie (9.7% of problems, 3.7x the industry average), doubly-linked-list (6.5% of problems, 3.4x the industry average), design (19.4% of problems, 3.3x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (48.4%), hash-table (38.7%), sorting (29%), string (25.8%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Implement Trie (Prefix Tree) A trie (pronounced as "try") or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are various appl... | Medium | Very Likely | hash-tablestringdesign | Solve |
Copy List with Random Pointer A linked list of length n is given such that each node contains an additional random pointer, which could point to any node in the list, or null. | Medium | Very Likely | hash-tablelinked-list | Solve |
Merge Intervals Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove... | Medium | Very Likely | arraysorting | Solve |
Design Authentication Manager There is an authentication system that works with authentication tokens. For each session, the user will receive a new authentication token that will expire tim... | Medium | Very Likely | hash-tablelinked-listdesign | Solve |
Rotting Oranges You are given an m x n grid where each cell can have one of three values: | Medium | Very Likely | arraybreadth-first-searchmatrix | Solve |
Top K Frequent Elements Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order. | Medium | Very Likely | arrayhash-tabledivide-and-conquer | Solve |
Integer to Roman Seven different symbols represent Roman numerals with the following values: | Medium | Very Likely | hash-tablemathstring | Solve |
Excel Sheet Column Number Given a string columnTitle that represents the column title as appears in an Excel sheet, return its corresponding column number. | Easy | Very Likely | mathstring | Solve |
Longest Substring Without Repeating Characters Given a string s, find the length of the longest substring without duplicate characters. | Medium | Very Likely | hash-tablestringsliding-window | Solve |
Find Median from Data Stream The median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value, and the median is the mean of the two midd... | Hard | Very Likely | two-pointersdesignsorting | Solve |
Sort Colors Given an array nums with n objects colored red, white, or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order... | Medium | Very Likely | arraytwo-pointerssorting | Solve |
Search Suggestions System You are given an array of strings products and a string searchWord. | Medium | Very Likely | arraystringbinary-search | Solve |
Reaching Points Given four integers sx, sy, tx, and ty, return true if it is possible to convert the point (sx, sy) to the point (tx, ty) through some operations, or false othe... | Hard | Very Likely | math | Solve |
Reorder Routes to Make All Paths Lead to the City Zero There are n cities numbered from 0 to n - 1 and n - 1 roads such that there is only one way to travel between two different cities (this network form a tree). L... | Medium | Likely | depth-first-searchbreadth-first-searchgraph | Solve |
Count Good Nodes in Binary Tree Given a binary tree root, a node X in the tree is named good if in the path from root to X there are no nodes with a value greater than X. | Medium | Likely | treedepth-first-searchbreadth-first-search | Solve |
IPO Suppose LeetCode will start its IPO soon. In order to sell a good price of its shares to Venture Capital, LeetCode would like to work on some projects to increa... | Hard | Likely | arraygreedysorting | Solve |
Optimal Partition of String Given a string s, partition the string into one or more substrings such that the characters in each substring are unique. That is, no letter appears in a single... | Medium | Likely | hash-tablestringgreedy | Solve |
Two Sum Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target. | Easy | Likely | arrayhash-map | Solve |
Clone Graph Given a reference of a node in a connected undirected graph. | Medium | Likely | hash-tabledepth-first-searchbreadth-first-search | Solve |
3Sum Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. | Medium | Likely | arraytwo-pointerssorting | Solve |
Product of Array Except Self Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. | Medium | Likely | arrayprefix-sum | Solve |
Merge k Sorted Lists You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. | Hard | Likely | linked-listdivide-and-conquerheap-priority-queue | Solve |
Insert Delete GetRandom O(1) Implement the RandomizedSet class: | Medium | Likely | arrayhash-tablemath | Solve |
Pairs of Songs With Total Durations Divisible by 60 You are given a list of songs where the ith song has a duration of time[i] seconds. | Medium | Likely | arrayhash-tablecounting | Solve |
Number of Islands Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands. | Medium | Likely | arraydepth-first-searchbreadth-first-search | Solve |
LRU Cache Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. | Medium | Likely | hash-tablelinked-listdesign | Solve |
Boats to Save People You are given an array people where people[i] is the weight of the ith person, and an infinite number of boats where each boat can carry a maximum weight of lim... | Medium | Likely | arraytwo-pointersgreedy | Solve |
Design Add and Search Words Data Structure Design a data structure that supports adding new words and finding if a string matches any previously added string. | Medium | Likely | stringdepth-first-searchdesign | Solve |
House Robber II You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in... | Medium | Likely | arraydynamic-programming | Solve |
Number of Atoms Given a string formula representing a chemical formula, return the count of each atom. | Hard | Likely | hash-tablestringstack | Solve |
Shortest Bridge You are given an n x n binary matrix grid where 1 represents land and 0 represents water. | Medium | Likely | arraydepth-first-searchbreadth-first-search | Solve |
Implement Trie (Prefix Tree)
SolveA trie (pronounced as "try") or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are various appl...
Copy List with Random Pointer
SolveA linked list of length n is given such that each node contains an additional random pointer, which could point to any node in the list, or null.
Merge Intervals
SolveGiven an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove...
Design Authentication Manager
SolveThere is an authentication system that works with authentication tokens. For each session, the user will receive a new authentication token that will expire tim...
Rotting Oranges
SolveYou are given an m x n grid where each cell can have one of three values:
Top K Frequent Elements
SolveGiven an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order.
Integer to Roman
SolveSeven different symbols represent Roman numerals with the following values:
Excel Sheet Column Number
SolveGiven a string columnTitle that represents the column title as appears in an Excel sheet, return its corresponding column number.
Longest Substring Without Repeating Characters
SolveGiven a string s, find the length of the longest substring without duplicate characters.
Find Median from Data Stream
SolveThe median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value, and the median is the mean of the two midd...
Sort Colors
SolveGiven an array nums with n objects colored red, white, or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order...
Search Suggestions System
SolveYou are given an array of strings products and a string searchWord.
Reaching Points
SolveGiven four integers sx, sy, tx, and ty, return true if it is possible to convert the point (sx, sy) to the point (tx, ty) through some operations, or false othe...
Reorder Routes to Make All Paths Lead to the City Zero
SolveThere are n cities numbered from 0 to n - 1 and n - 1 roads such that there is only one way to travel between two different cities (this network form a tree). L...
Count Good Nodes in Binary Tree
SolveGiven a binary tree root, a node X in the tree is named good if in the path from root to X there are no nodes with a value greater than X.
IPO
SolveSuppose LeetCode will start its IPO soon. In order to sell a good price of its shares to Venture Capital, LeetCode would like to work on some projects to increa...
Optimal Partition of String
SolveGiven a string s, partition the string into one or more substrings such that the characters in each substring are unique. That is, no letter appears in a single...
Two Sum
SolveGiven an array of integers nums and an integer target, return the indices of the two numbers that add up to target.
Clone Graph
SolveGiven a reference of a node in a connected undirected graph.
3Sum
SolveGiven an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.
Product of Array Except Self
SolveGiven an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].
Merge k Sorted Lists
SolveYou are given an array of k linked-lists lists, each linked-list is sorted in ascending order.
Pairs of Songs With Total Durations Divisible by 60
SolveYou are given a list of songs where the ith song has a duration of time[i] seconds.
Number of Islands
SolveGiven an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands.
LRU Cache
SolveDesign a data structure that follows the constraints of a Least Recently Used (LRU) cache.
Boats to Save People
SolveYou are given an array people where people[i] is the weight of the ith person, and an infinite number of boats where each boat can carry a maximum weight of lim...
Design Add and Search Words Data Structure
SolveDesign a data structure that supports adding new words and finding if a string matches any previously added string.
House Robber II
SolveYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in...
Number of Atoms
SolveGiven a string formula representing a chemical formula, return the count of each atom.
Shortest Bridge
SolveYou are given an n x n binary matrix grid where 1 represents land and 0 represents water.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Docusign interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Docusign interviews focus heavily on array, hash-table, sorting problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Docusign interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Docusign has been reported to ask 31 distinct coding problems. The most common topics are array, hash-table, sorting. 2 are Easy difficulty, 24 are Medium, and 5 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 31 reported problems, Docusign interviews are in line with industry averages - 16% Hard vs 18% overall. 77% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, hash-table, sorting. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Docusign coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Docusign interview with AIarrow_forward
