Docusign Interview Questions

Design a data structure that supports insertion, deletion, and random element retrieval, all in constant time on average. You'll need to handle edge cases carefully to achieve O(1) complexity.

Given a grid representing land and water, count the number of distinct islands. An island is formed by connected land cells.

Design a data structure that efficiently stores a set of strings and allows for prefix-based searches. Implement methods to insert strings, search for complete words, and check if any word starts with a given prefix.

You're given a linked list where each node has a regular 'next' pointer and a 'random' pointer. Create a deep copy of this list, preserving both the next and random pointer relationships.

You're given the coordinates of several points. Determine the maximum area of any triangle that can be formed using these points.

Design a system to manage user authentication tokens. Implement features to generate, renew, and count unexpired tokens, while handling token expiration.

You are given a grid of oranges, some fresh, some rotten. Rotten oranges contaminate adjacent fresh oranges; find the minimum time until all oranges are rotten.

Find the k most frequent elements in a given array of numbers. Return the top k elements based on their frequency.

You are given a collection of intervals. Merge all overlapping intervals into a single interval and return the result.

Implement a search suggestion system. Given a search word and a list of product names, return the top 3 product suggestions after each character of the search word is typed.

Design a data structure that efficiently finds the median of a dynamically growing stream of numbers. You need to implement methods to add new numbers and quickly retrieve the current median.

You're given an array containing only 0s, 1s, and 2s. Sort the array in place so that elements of the same value are grouped together.

Given a column title as appears in an Excel sheet, return its corresponding column number. For example, 'A' corresponds to 1, 'B' to 2, 'AA' to 27, and so on.

Convert a given integer into its Roman numeral representation. You need to understand the mapping between integer values and Roman symbols to perform the conversion accurately.

Find the length of the longest substring within a given string that contains no repeating characters. The substring must be contiguous.

Find the inorder successor of a given node in a Binary Search Tree (BST). The inorder successor is the node with the smallest key greater than the given node's key.

Imagine two islands represented by ones in a grid of zeros and ones. Find the shortest path to connect the two islands by changing zeros to ones.

Decode a chemical formula to count the number of atoms of each element. The formula may contain nested parentheses and numbers indicating counts.

Find the length of the longest substring containing the same character you can obtain after performing at most k replacements of characters in the given string. You can only replace characters with other characters.

Determine if a given string can be rearranged to form a palindrome. Essentially, you need to check if the string has at most one character with an odd frequency.