| Find the Team Size Problem |
Easy
|
amazon
|
|
| Reverse Linked List 2 - between m and n |
Medium
|
adobe
amazon
apple
bloomberg
bytedance
docusign
facebook
google
microsoft
oracle
|
|
| Equal Average Partition |
Medium
|
amazon
|
|
| Longest String Chain Problem |
Medium
|
akuna-capital
amazon
citadel
google
sap
two-sigma
vmware
|
|
| Minimum Triangle path sum from top to bottom |
Medium
|
amazon
apple
bloomberg
goldman-sachs
google
houzz
microsoft
|
|
| Word Search 1 - Find if word exists |
Medium
|
adobe
amazon
apple
bloomberg
bytedance
coupang
coursera
cruise-automation
docusign
facebook
google
intuit
jpmorgan
linkedin
lyft
microsoft
oracle
pinterest
quantcast
snapchat
uber
vmware
yahoo
zillow
|
|
| Word Search 2 - Return All Words |
Hard
|
airbnb
amazon
apple
bloomberg
bytedance
cisco
citadel
facebook
google
houzz
microsoft
oracle
roblox
salesforce
snapchat
uber
yahoo
zillow
|
|
| Longest Substring Without Repeating Characters |
Medium
|
adobe
alation
alibaba
amazon
apple
atlassian
baidu
bloomberg
bytedance
cisco
coupang
ebay
expedia
facebook
goldman-sachs
google
huawei
microsoft
oracle
paypal
salesforce
samsung
sap
snapchat
spotify
twitch
uber
vmware
yahoo
yandex
yelp
zillow
zoho
|
|
| Sum Root to Leaf Numbers |
Medium
|
amazon
bloomberg
ebay
facebook
google
microsoft
|
|
| Maximum Sum Circular Subarray |
Medium
|
amazon
facebook
two-sigma
uber
|
|
| Top K Frequent Words Problem |
Medium
|
adobe
amazon
apple
atlassian
bloomberg
expedia
facebook
google
linkedin
microsoft
oracle
pocket-gems
salesforce
tripadvisor
uber
vmware
yelp
|
|
| Delete non-tail Node in linked list, Given only access to that Node |
Medium
|
adobe
amazon
apple
bloomberg
cisco
facebook
goldman-sachs
google
microsoft
qualcomm
yahoo
|
|
| Binary Tree Traversal - Vertical Order Traversal |
Medium
|
adobe
amazon
bloomberg
bytedance
databricks
expedia
facebook
google
mathworks
microsoft
oracle
reddit
salesforce
snapchat
wish
|
|
| Design Add and Search Words Data Structure |
Medium
|
airbnb
amazon
apple
ebay
facebook
google
microsoft
salesforce
uber
|
|
| Score of Parentheses Problem |
Medium
|
adobe
amazon
bytedance
|
|
| Design Circular Queue Problem |
Medium
|
airbnb
amazon
apple
citadel
cloudera
facebook
google
microsoft
oracle
splunk
|
|
| Camelcase Matching Problem |
Medium
|
amazon
google
|
|
| 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
|
|
| Remove Covered Intervals |
Medium
|
amazon
|
|
| Longest Happy String Problem |
Medium
|
amazon
wayfair
|
|
| 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
|
|
| Flip Equivalent Binary Trees Problem |
Medium
|
amazon
ebay
google
|
|
| 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
|
|
| Run-length Encoding |
Easy
|
amazon
|
|
| Partition Equal Subset Sum |
Medium
|
amazon
apple
ebay
facebook
google
microsoft
paypal
uber
vmware
yahoo
|
|
| Convert BST to Greater Sum Tree |
Medium
|
amazon
apple
microsoft
uber
|
|
| Longest Absolute File Path Problem |
Medium
|
amazon
apple
facebook
google
uber
wish
|
|
| Rotate String Problem |
Easy
|
amazon
apple
ebay
google
linkedin
microsoft
oracle
|
|