Short Encoding of Words |
Medium
|
|
|
Course Schedule 3 |
Hard
|
google
microsoft
works-applications
|
|
Moving Average of Last N numbers in a Stream |
Easy
|
amazon
appdynamics
bloomberg
facebook
google
indeed
microsoft
twitter
uber
|
|
Moving Average of All Numbers in Stream |
Easy
|
|
|
Maximum Points You Can Obtain from Cards Problem |
Medium
|
flipkart
google
|
|
Design HashMap |
Easy
|
adobe
amazon
apple
atlassian
dell
facebook
goldman-sachs
google
linkedin
microsoft
nvidia
oracle
reddit
salesforce
servicenow
tableau
twitter
uber
vmware
|
|
Design Hashset |
Easy
|
amazon
google
|
|
Ugly Number |
Easy
|
facebook
|
|
Super Ugly Number |
Medium
|
google
|
|
Rearrange Array Elements by Sign |
Medium
|
|
|
Basic Calculator 4 |
Hard
|
amazon
google
indeed
intuit
pinterest
roblox
|
|
Basic Calculator 3 |
Hard
|
amazon
apple
bytedance
doordash
facebook
google
houzz
hulu
jingchi
microsoft
pinterest
pocket-gems
snapchat
uber
|
|
Basic Calculator 2 Problem |
Medium
|
airbnb
amazon
apple
atlassian
doordash
ebay
facebook
google
houzz
indeed
intuit
ixl
microsoft
oracle
paypal
postmates
reddit
snapchat
tableau
tencent
uber
|
|
Basic Calculator 1 |
Hard
|
adobe
amazon
bloomberg
facebook
google
indeed
intuit
jump-trading
karat
microsoft
paypal
pinterest
robinhood
roblox
snapchat
uber
|
|
Best Meeting Point |
Hard
|
amazon
facebook
google
linkedin
snapchat
twitter
|
|
Random Flip Matrix |
Medium
|
google
|
|
Random Pick Index |
Medium
|
facebook
google
uber
|
|
Reservoir Sampling Explained |
|
facebook
|
|
Fisher-Yates Shuffle vs Reservoir Sampling |
|
|
|
Blum Floyd Pratt Rivest Tarjan Algorithm |
Medium
|
|
|
Add Digits in Number |
Easy
|
adobe
apple
bloomberg
microsoft
|
|
Implement Power Function 2 |
Easy
|
|
|
Reverse Linked List 2 - between m and n |
Medium
|
adobe
amazon
apple
bloomberg
bytedance
docusign
facebook
google
microsoft
oracle
|
|
Get sqrt nth node in Linked List |
Medium
|
|
|
Equal Average Partition |
Medium
|
amazon
|
|
Binary Tree Cameras |
Hard
|
ebay
facebook
google
uber
|
|
Longest String Chain |
Medium
|
akuna-capital
amazon
citadel
google
sap
two-sigma
vmware
|
|
Delete Operation for Two Strings |
Medium
|
google
|
|
Maximum Triangle path sum from top to bottom |
Easy
|
google
|
|
Minimum Triangle path sum from top to bottom |
Medium
|
amazon
apple
bloomberg
goldman-sachs
google
houzz
microsoft
|
|
Number Complement |
Easy
|
cloudera
|
|
First Bad Version |
Easy
|
adobe
amazon
bloomberg
facebook
google
microsoft
uber
|
|
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
|
|
All Possible Full Binary Trees |
Medium
|
google
oracle
|
|
Maximum Sum Circular Subarray |
Medium
|
amazon
facebook
two-sigma
uber
|
|
Calculate Hash Code for String |
Medium
|
|
|
Top K Frequent Words |
Medium
|
adobe
amazon
apple
atlassian
bloomberg
expedia
facebook
google
linkedin
microsoft
oracle
pocket-gems
salesforce
tripadvisor
uber
vmware
yelp
|
|
H-Index 2 |
Medium
|
facebook
|
|
Weighted Graph Representation - Adjacency List of Pair and map |
|
|
|
Coin Change with Fewest Number of Coins Given Canonical System and Infinite Supply |
Medium
|
google
|
|
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
|
|
H-Index |
Medium
|
adobe
bloomberg
facebook
google
tripadvisor
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
|
|
Map-based Trie Implementation |
|
|
|
Max Chunks to Make Sorted |
Medium
|
google
microsoft
uber
|
|
NSL - Nearest Smallest Element to Left of Every Element |
Easy
|
|
|