MongoDB

20 LeetCode interview questions

Difficulty Distribution

Easy

10%

Medium

60%

Hard

30%

Title	Difficulty	Acceptance	Frequency	Topics
Word Break	Medium	49.1%	100.0%	ArrayHash TableString+3
Intersection of Two Arrays	Easy	77.5%	100.0%	ArrayHash TableTwo Pointers+2
Implement Trie (Prefix Tree)	Medium	69.2%	100.0%	Hash TableStringDesign+1
Text Justification	Hard	50.4%	87.5%	ArrayStringSimulation
Insert Interval	Medium	44.7%	75.0%	Array
Web Crawler Multithreaded	Medium	51.0%	75.0%
Merge Two Binary Trees	Easy	79.0%	75.0%	TreeDepth-First SearchBreadth-First Search+1
Stock Price Fluctuation	Medium	48.9%	75.0%	Hash TableDesignHeap (Priority Queue)+2
Merge k Sorted Lists	Hard	58.8%	75.0%	Linked ListDivide and ConquerHeap (Priority Queue)+1
Convert JSON String to Object	Hard	61.1%	75.0%
Snapshot Array	Medium	36.7%	75.0%	ArrayHash TableBinary Search+1
Search in Rotated Sorted Array	Medium	44.1%	62.5%	ArrayBinary Search
Sliding Window Maximum	Hard	48.4%	62.5%	ArrayQueueSliding Window+2
Lowest Common Ancestor of a Binary Tree	Medium	68.7%	62.5%	TreeDepth-First SearchBinary Tree
Design Search Autocomplete System	Hard	49.7%	62.5%
Course Schedule II	Medium	55.0%	62.5%	Depth-First SearchBreadth-First SearchGraph Theory+1
Lowest Common Ancestor of a Binary Tree III	Medium	82.9%	62.5%
String Compression	Medium	59.5%	62.5%	Two PointersString
Word Break II	Hard	55.1%	62.5%	ArrayHash TableString+4
LRU Cache	Medium	46.8%	62.5%	Hash TableLinked ListDesign+1

Showing 20 of 20 questions