Question 1

Implement Trie (Prefix Tree) — Docusign Interview Question

Accepted Answer

"Implement Trie (Prefix Tree)" is a medium difficulty problem asked at Docusign interviews. It covers the following topics: Hash Table, String, Design, Trie. You can practice it on LeetCode: https://leetcode.com/problems/implement-trie-prefix-tree

Question 2

Copy List with Random Pointer — Docusign Interview Question

Accepted Answer

"Copy List with Random Pointer" is a medium difficulty problem asked at Docusign interviews. It covers the following topics: Hash Table, Linked List. You can practice it on LeetCode: https://leetcode.com/problems/copy-list-with-random-pointer

Question 3

Top K Frequent Elements — Docusign Interview Question

Accepted Answer

"Top K Frequent Elements" is a medium difficulty problem asked at Docusign interviews. It covers the following topics: Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect. You can practice it on LeetCode: https://leetcode.com/problems/top-k-frequent-elements

Question 4

Rotting Oranges — Docusign Interview Question

Accepted Answer

"Rotting Oranges" is a medium difficulty problem asked at Docusign interviews. It covers the following topics: Array, Breadth-First Search, Matrix. You can practice it on LeetCode: https://leetcode.com/problems/rotting-oranges

Question 5

Merge Intervals — Docusign Interview Question

Accepted Answer

"Merge Intervals" is a medium difficulty problem asked at Docusign interviews. It covers the following topics: Array, Sorting. You can practice it on LeetCode: https://leetcode.com/problems/merge-intervals

Question 6

Design Authentication Manager — Docusign Interview Question

Accepted Answer

"Design Authentication Manager" is a medium difficulty problem asked at Docusign interviews. It covers the following topics: Hash Table, Linked List, Design, Doubly-Linked List. You can practice it on LeetCode: https://leetcode.com/problems/design-authentication-manager

#	Question Title	Difficulty	Frequency	Topics
1	Implement Trie (Prefix Tree)	MEDIUM	100.0	Hash TableStringDesign+1
2	Copy List with Random Pointer	MEDIUM	95.8	Hash TableLinked List
3	Top K Frequent Elements	MEDIUM	84.8	ArrayHash TableDivide and Conquer+5
4	Rotting Oranges	MEDIUM	84.8	ArrayBreadth-First SearchMatrix
5	Merge Intervals	MEDIUM	84.8	ArraySorting
6	Design Authentication Manager	MEDIUM	84.8	Hash TableLinked ListDesign+1
7	Reaching Points	HARD	77.0	Math
8	Find Median from Data Stream	HARD	77.0	Two PointersDesignSorting+2
9	Longest Substring Without Repeating Characters	MEDIUM	77.0	Hash TableStringSliding Window
10	Integer to Roman	MEDIUM	77.0	Hash TableMathString

Explore 450+ Companies

Companies

Docusign

Want to see more?

Docusign Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

Docusign

Want to see more?

Docusign Interview Questions

Ai Assistant Kas