| Design Add and Search Words Data Structure |
Medium
|
airbnb
amazon
apple
ebay
facebook
google
microsoft
salesforce
uber
|
|
| Design Circular Queue Problem |
Medium
|
airbnb
amazon
apple
citadel
cloudera
facebook
google
microsoft
oracle
splunk
|
|
| Minimum Remove to Make Valid Parentheses |
Medium
|
amazon
bloomberg
bytedance
facebook
google
microsoft
|
|
| Serialize and Deserialize N-Ary Tree |
Hard
|
amazon
apple
ebay
facebook
google
linkedin
microsoft
pinterest
uber
|
|
| Open the Lock Problem |
Medium
|
amazon
bloomberg
facebook
google
uber
|
|
| Partition Labels Problem |
Medium
|
amazon
apple
facebook
|
|
| Trim a Binary Search Tree BST |
Medium
|
adobe
amazon
apple
bloomberg
facebook
google
microsoft
yahoo
|
|
| Flatten Binary Tree to Linked List in Order of Preorder Traversal |
Medium
|
adobe
amazon
apple
bloomberg
bytedance
coupang
databricks
facebook
google
microsoft
nvidia
oracle
uber
yahoo
|
|
| Encode and Decode TinyURL Problem |
Medium
|
adobe
amazon
bloomberg
facebook
google
microsoft
oracle
uber
|
|
| Decode String Problem |
Medium
|
alibaba
amazon
appdynamics
apple
atlassian
bloomberg
bytedance
cisco
coupang
cruise-automation
ebay
facebook
google
huawei
hulu
microsoft
oracle
salesforce
snapchat
tencent
vmware
yahoo
yelp
|
|
| Rotate an Array to Left |
Medium
|
facebook
|
|
| Partition Equal Subset Sum |
Medium
|
amazon
apple
ebay
facebook
google
microsoft
paypal
uber
vmware
yahoo
|
|
| Longest Absolute File Path Problem |
Medium
|
amazon
apple
facebook
google
uber
wish
|
|