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
LeetCode ↗48% acc.
2
MediumWeb Crawler Multithreaded
95
Depth-First SearchBreadth-First SearchConcurrency
LeetCode ↗50% acc.
3
EasyIntersection of Two Arrays✓ Our Solution
95
ArrayHash TableTwo PointersBinary Search+1
LeetCode ↗76% acc.
4
MediumInsert Interval✓ Our Solution
89
Array
LeetCode ↗43% acc.
5
EasyMerge Two Binary Trees✓ Our Solution
89
TreeDepth-First SearchBreadth-First SearchBinary Tree
LeetCode ↗79% acc.
6
MediumStock Price Fluctuation✓ Our Solution
89
Hash TableDesignHeap (Priority Queue)Data Stream+1
LeetCode ↗48% acc.
7
HardText Justification✓ Our Solution
89
ArrayStringSimulation
LeetCode ↗48% acc.
8
MediumLRU Cache✓ Our Solution
82
Hash TableLinked ListDesignDoubly-Linked List
LeetCode ↗45% acc.
9
HardMerge k Sorted Lists✓ Our Solution
82
Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
LeetCode ↗57% acc.
10
MediumValid Sudoku✓ Our Solution
71
ArrayHash TableMatrix
LeetCode ↗62% acc.
11
MediumSearch in Rotated Sorted Array✓ Our Solution
71
ArrayBinary Search
LeetCode ↗43% acc.
12
MediumDesign Hit Counter
71
ArrayBinary SearchDesignQueue+1
LeetCode ↗69% acc.
13
HardSliding Window Maximum✓ Our Solution
71
ArrayQueueSliding WindowHeap (Priority Queue)+1
LeetCode ↗48% acc.
14
MediumLowest Common Ancestor of a Binary Tree✓ Our Solution
71
TreeDepth-First SearchBinary Tree
LeetCode ↗67% acc.