LeetCode
Question
·
Sep 2020
Microsoft Sept 2020 virtual round
1,064 views
1 reply
Question Details
Round 1 : Design LRU cache Round 2 : Check if a tree has all it\'s left node smaller than right node Round 3 : Unique Path 2 (Basic dp problem) Design Tic-Tac-Toe Round 4 (Hiring Manager...
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Graph
Binary Tree
Queue
Dynamic Programming
Stack