M

MongoDB

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

Showing 14 of 14 questions

1
MediumWord Breakβœ“ Our Solution
100
ArrayHash TableStringDynamic Programming+2
2
MediumWeb Crawler Multithreaded
95
Depth-First SearchBreadth-First SearchConcurrency
3
EasyIntersection of Two Arraysβœ“ Our Solution
95
ArrayHash TableTwo PointersBinary Search+1
4
MediumInsert Intervalβœ“ Our Solution
89
Array
5
EasyMerge Two Binary Treesβœ“ Our Solution
89
TreeDepth-First SearchBreadth-First SearchBinary Tree
6
MediumStock Price Fluctuationβœ“ Our Solution
89
Hash TableDesignHeap (Priority Queue)Data Stream+1
7
HardText Justificationβœ“ Our Solution
89
ArrayStringSimulation
8
MediumLRU Cacheβœ“ Our Solution
82
Hash TableLinked ListDesignDoubly-Linked List
9
HardMerge k Sorted Listsβœ“ Our Solution
82
Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
10
MediumValid Sudokuβœ“ Our Solution
71
ArrayHash TableMatrix
11
MediumSearch in Rotated Sorted Arrayβœ“ Our Solution
71
ArrayBinary Search
12
MediumDesign Hit Counter
71
ArrayBinary SearchDesignQueue+1
13
HardSliding Window Maximumβœ“ Our Solution
71
ArrayQueueSliding WindowHeap (Priority Queue)+1
14
MediumLowest Common Ancestor of a Binary Treeβœ“ Our Solution
71
TreeDepth-First SearchBinary Tree