Back to Companies

MongoDB Interview Questions (20)

Practice real interview problems from MongoDB

All20 Easy2 Medium12 Hard6

Status	Title	Solution	Practice	Difficulty	Companies	Topics
	23. Merge k Sorted Lists	Solution	Solve	Hard	Accenture+52	Divide and Conquer Heap (Priority Queue)+2
	33. Search in Rotated Sorted Array	Solution	Solve	Medium	Accolite+54	Array Binary Search
	57. Insert Interval	Solution	Solve	Medium	Amazon+15	Array
	68. Text Justification	Solution	Solve	Hard	Airbnb+39	Array Simulation+1
	139. Word Break	Solution	Solve	Medium	Amazon+34	Array Dynamic Programming+4
	140. Word Break II	Solution	Solve	Hard	Amazon+13	Array Backtracking+5
	146. LRU Cache	Solution	Solve	Medium	Adobe+127	Design Doubly-Linked List+2
	208. Implement Trie (Prefix Tree)	Solution	Solve	Medium	Adobe+23	Design Hash Table+2
	210. Course Schedule II	Solution	Solve	Medium	Amazon+32	Breadth-First Search Depth-First Search+2
	236. Lowest Common Ancestor of a Binary Tree	Solution	Solve	Medium	Adobe+22	Binary Tree Depth-First Search+1
	239. Sliding Window Maximum	Solution	Solve	Hard	Adobe+47	Array Heap (Priority Queue)+3
	349. Intersection of Two Arrays	Solution	Solve	Easy	Accenture+19	Array Binary Search+3
	443. String Compression	Solution	Solve	Medium	Adobe+42	String Two Pointers
	617. Merge Two Binary Trees	Solution	Solve	Easy	Amazon+7	Binary Tree Breadth-First Search+2
	642. Design Search Autocomplete System	Solution	Solve	Hard	Amazon+13	Data Stream Depth-First Search+5
	1146. Snapshot Array	Solution	Solve	Medium	Amazon+17	Array Binary Search+2
	1242. Web Crawler Multithreaded	Solution	Solve	Medium	Anthropic+8	Breadth-First Search Concurrency+1
	1650. Lowest Common Ancestor of a Binary Tree III	Solution	Solve	Medium	Amazon+9	Binary Tree Hash Table+2
	2034. Stock Price Fluctuation	Solution	Solve	Medium	Amazon+7	Data Stream Design+3
	2759. Convert JSON String to Object	Solution	Solve	Hard	MongoDB+1

Merge k Sorted Lists

Hard✓ Solution📹 Video

Accenture+52

Divide and Conquer Heap (Priority Queue)Linked List+1

Search in Rotated Sorted Array

Medium✓ Solution

Accolite+54

Array Binary Search

Insert Interval

Medium✓ Solution

Amazon+15

Text Justification

Hard✓ Solution

Airbnb+39

Array Simulation String

Word Break

Medium✓ Solution📹 Video

Amazon+34

Array Dynamic Programming Hash Table+3

Word Break II

Hard✓ Solution

Amazon+13

Array Backtracking Dynamic Programming+4

LRU Cache

Medium✓ Solution

Adobe+127

Design Doubly-Linked List Hash Table+1

Implement Trie (Prefix Tree)

Medium✓ Solution

Adobe+23

Design Hash Table String+1

Course Schedule II

Medium✓ Solution📹 Video

Amazon+32

Breadth-First Search Depth-First Search Graph+1

Lowest Common Ancestor of a Binary Tree

Medium✓ Solution

Adobe+22

Binary Tree Depth-First Search Tree

Sliding Window Maximum

Hard✓ Solution

Adobe+47

Array Heap (Priority Queue)Monotonic Queue+2

Intersection of Two Arrays

Easy✓ Solution

Accenture+19

Array Binary Search Hash Table+2

String Compression

Medium✓ Solution

Adobe+42

String Two Pointers

Merge Two Binary Trees

Easy✓ Solution📹 Video

Amazon+7

Binary Tree Breadth-First Search Depth-First Search+1

Design Search Autocomplete System

Hard✓ Solution

Amazon+13

Data Stream Depth-First Search Design+4

Snapshot Array

Medium✓ Solution📹 Video

Amazon+17

Array Binary Search Design+1

Web Crawler Multithreaded

Medium📹 Video

Anthropic+8

Breadth-First Search Concurrency Depth-First Search

Lowest Common Ancestor of a Binary Tree III

Medium

Amazon+9

Binary Tree Hash Table Tree+1

Stock Price Fluctuation

Medium✓ Solution📹 Video

Amazon+7

Data Stream Design Hash Table+2

Convert JSON String to Object

Hard✓ Solution📹 Video

MongoDB+1