Docusign LeetCode Interview Questions
Practice 47 real coding problems frequently asked in Docusign technical interviews. Master these questions to ace your next Docusign software engineering interview.
Top Topics at Docusign
Ace your Docusign interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Docusign Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Roman to Integer 100% | EasyE | Solve→ |
Insert Delete GetRandom O(1) 93% | MediumM | Solve→ |
Combination Sum 85% | MediumM | Solve→ |
Sort Colors 85% | MediumM | Solve→ |
Maximum Depth of Binary Tree 85% | EasyE | Solve→ |
Unique Paths II 83% | MediumM | Solve→ |
Longest Increasing Subsequence 82% | MediumM | Solve→ |
Design an Array Statistics Tracker 81% | HardH | Solve→ |
Nested List Weight Sum 79% | MediumM | Solve→ |
Squares of a Sorted Array 78% | EasyE | Solve→ |
Count Unhappy Friends 76% | MediumM | Solve→ |
Convert Sorted List to Binary Search Tree 73% | MediumM | Solve→ |
Closest Binary Search Tree Value 73% | EasyE | Solve→ |
Moving Average from Data Stream 72% | EasyE | Solve→ |
Maximum Subarray 71% | MediumM | Solve→ |
Kth Missing Positive Number 71% | EasyE | Solve→ |
LRU Cache 70% | MediumM | Solve→ |
Max Consecutive Ones III 68% | MediumM | Solve→ |
Search a 2D Matrix 65% | MediumM | Solve→ |
Sqrt(x) 65% | EasyE | Solve→ |
Sum Root to Leaf Numbers 65% | MediumM | Solve→ |
Design Hit Counter 65% | MediumM | Solve→ |
Vertical Order Traversal of a Binary Tree 64% | HardH | Solve→ |
Linked List Cycle 64% | EasyE | Solve→ |
Single Number 64% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Best Time to Buy and Sell Stock IV 61% | HardH | Solve→ |
Is Subsequence 60% | EasyE | Solve→ |
Trapping Rain Water 58% | HardH | Solve→ |
Group Shifted Strings 58% | MediumM | Solve→ |
3Sum 57% | MediumM | Solve→ |
Final Array State After K Multiplication Operations I 54% | EasyE | Solve→ |
Two Best Non-Overlapping Events 51% | MediumM | Solve→ |
Subsets 51% | MediumM | Solve→ |
Find K Closest Elements 44% | MediumM | Solve→ |
Zero Array Transformation III 41% | MediumM | Solve→ |
Two Sum 40% | EasyE | Solve→ |
The Earliest Moment When Everyone Become Friends 40% | MediumM | Solve→ |
Custom Sort String 39% | MediumM | Solve→ |
Maximum Units on a Truck 39% | EasyE | Solve→ |
Number of Ships in a Rectangle 36% | HardH | Solve→ |
Integer to Roman 35% | MediumM | Solve→ |
Remove Letter To Equalize Frequency 29% | EasyE | Solve→ |
Subarray Sum Equals K 26% | MediumM | Solve→ |
Can Place Flowers 23% | EasyE | Solve→ |
Find Median from Data Stream 22% | HardH | Solve→ |
Toeplitz Matrix 21% | EasyE | Solve→ |
Search Suggestions System 20% | MediumM | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Docusign ask in interviews?
Docusign commonly asks 47 coding problems in technical interviews, including Roman to Integer, Insert Delete GetRandom O(1), Combination Sum. The difficulty breakdown is 16 Easy, 25 Medium, and 6 Hard problems.
How should I prepare for a Docusign coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Docusign interviews typically emphasize Array and Hash Table. Practice explaining your thought process while coding.
What is the difficulty level of Docusign coding interviews?
Based on our data, Docusign interviews include 16 Easy (34%), 25 Medium (53%), and 6 Hard (13%) problems.
Ready to ace your Docusign interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required