D

Docusign

34 questions tracked31 with solutions
πŸ”
Frequency scoreSorted highest β†’ lowest frequencyβœ“ Our Solution = we have a detailed walkthrough

Showing 34 of 34 questions

1
MediumImplement Trie (Prefix Tree)βœ“ Our Solution
100
Hash TableStringDesignTrie
2
MediumCopy List with Random Pointerβœ“ Our Solution
96
Hash TableLinked List
3
MediumTop K Frequent Elementsβœ“ Our Solution
85
ArrayHash TableDivide and ConquerSorting+4
4
MediumRotting Orangesβœ“ Our Solution
85
ArrayBreadth-First SearchMatrix
5
MediumMerge Intervalsβœ“ Our Solution
85
ArraySorting
6
MediumDesign Authentication Managerβœ“ Our Solution
85
Hash TableLinked ListDesignDoubly-Linked List
7
HardReaching Pointsβœ“ Our Solution
77
Math
8
HardFind Median from Data Streamβœ“ Our Solution
77
Two PointersDesignSortingHeap (Priority Queue)+1
9
MediumLongest Substring Without Repeating Charactersβœ“ Our Solution
77
Hash TableStringSliding Window
10
MediumInteger to Romanβœ“ Our Solution
77
Hash TableMathString
11
EasyExcel Sheet Column Numberβœ“ Our Solution
77
MathString
12
MediumSearch Suggestions Systemβœ“ Our Solution
77
ArrayStringBinary SearchTrie+2
13
MediumSort Colorsβœ“ Our Solution
77
ArrayTwo PointersSorting
14
MediumShortest Bridgeβœ“ Our Solution
66
ArrayDepth-First SearchBreadth-First SearchMatrix
15
MediumHouse Robber IIβœ“ Our Solution
66
ArrayDynamic Programming
16
HardNumber of Atomsβœ“ Our Solution
66
Hash TableStringStackSorting
17
MediumPairs of Songs With Total Durations Divisible by 60βœ“ Our Solution
66
ArrayHash TableCounting
18
MediumMeeting Rooms II
66
ArrayTwo PointersGreedySorting+2
19
MediumDesign Add and Search Words Data Structureβœ“ Our Solution
66
StringDepth-First SearchDesignTrie
20
MediumCount Good Nodes in Binary Treeβœ“ Our Solution
66
TreeDepth-First SearchBreadth-First SearchBinary Tree
21
MediumNumber of Islandsβœ“ Our Solution
66
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
22
MediumInsert Delete GetRandom O(1)βœ“ Our Solution
66
ArrayHash TableMathDesign+1
23
66
ArrayHash Table
24
MediumInorder Successor in BST
66
TreeDepth-First SearchBinary Search TreeBinary Tree
25
MediumReorder Routes to Make All Paths Lead to the City Zeroβœ“ Our Solution
66
Depth-First SearchBreadth-First SearchGraph
26
MediumLRU Cacheβœ“ Our Solution
66
Hash TableLinked ListDesignDoubly-Linked List
27
EasyPalindrome Permutation
66
Hash TableStringBit Manipulation
28
66
ArrayGreedySortingHeap (Priority Queue)
29
MediumOptimal Partition of Stringβœ“ Our Solution
66
Hash TableStringGreedy
30
MediumBoats to Save Peopleβœ“ Our Solution
66
ArrayTwo PointersGreedySorting
31
MediumProduct of Array Except Selfβœ“ Our Solution
66
ArrayPrefix Sum
32
MediumClone Graphβœ“ Our Solution
66
Hash TableDepth-First SearchBreadth-First SearchGraph
33
66
ArrayTwo PointersSorting
34
HardMerge k Sorted Listsβœ“ Our Solution
66
Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort