Docusign Interview Questions — 34 DSA Problems

31 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Docusign LeetCode questions for software engineering interviews.

• Implement Trie (Prefix Tree) (MEDIUM) — Hash Table, String, Design, Trie
• Copy List with Random Pointer (MEDIUM) — Hash Table, Linked List
• Top K Frequent Elements (MEDIUM) — Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect
• Rotting Oranges (MEDIUM) — Array, Breadth-First Search, Matrix
• Merge Intervals (MEDIUM) — Array, Sorting
• Design Authentication Manager (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
• Reaching Points (HARD) — Math
• Find Median from Data Stream (HARD) — Two Pointers, Design, Sorting, Heap (Priority Queue), Data Stream
• Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
• Integer to Roman (MEDIUM) — Hash Table, Math, String
• Excel Sheet Column Number (EASY) — Math, String
• Search Suggestions System (MEDIUM) — Array, String, Binary Search, Trie, Sorting, Heap (Priority Queue)
• Sort Colors (MEDIUM) — Array, Two Pointers, Sorting
• Shortest Bridge (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Matrix
• House Robber II (MEDIUM) — Array, Dynamic Programming
• Number of Atoms (HARD) — Hash Table, String, Stack, Sorting
• Pairs of Songs With Total Durations Divisible by 60 (MEDIUM) — Array, Hash Table, Counting
• Meeting Rooms II (MEDIUM) — Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum
• Design Add and Search Words Data Structure (MEDIUM) — String, Depth-First Search, Design, Trie
• Count Good Nodes in Binary Tree (MEDIUM) — Tree, Depth-First Search, Breadth-First Search, Binary Tree
• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Insert Delete GetRandom O(1) (MEDIUM) — Array, Hash Table, Math, Design, Randomized
• Two Sum (EASY) — Array, Hash Table
• Inorder Successor in BST (MEDIUM) — Tree, Depth-First Search, Binary Search Tree, Binary Tree
• Reorder Routes to Make All Paths Lead to the City Zero (MEDIUM) — Depth-First Search, Breadth-First Search, Graph
• LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
• Palindrome Permutation (EASY) — Hash Table, String, Bit Manipulation
• IPO (HARD) — Array, Greedy, Sorting, Heap (Priority Queue)
• Optimal Partition of String (MEDIUM) — Hash Table, String, Greedy
• Boats to Save People (MEDIUM) — Array, Two Pointers, Greedy, Sorting
• Product of Array Except Self (MEDIUM) — Array, Prefix Sum
• Clone Graph (MEDIUM) — Hash Table, Depth-First Search, Breadth-First Search, Graph
• 3Sum (MEDIUM) — Array, Two Pointers, Sorting
• Merge k Sorted Lists (HARD) — Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort