Maximum Product of Word Lengths | Medium | google | |
Minimum Height Trees | Medium | amazon
apple
bloomberg
facebook
google
snapchat | |
Remove Duplicate Letters Problem | Medium | adobe
amazon
apple
bytedance
facebook
google
microsoft
nutanix
yahoo | |
Binary Tree Longest Consecutive Sequence Problem | Medium | amazon
facebook
google
uber | |
Longest Consecutive Sequence Problem | Medium | adobe
amazon
apple
bloomberg
facebook
google
microsoft
nutanix
oracle
paypal
spotify
uber
wish | |
Find the Celebrity Problem | Medium | amazon
apple
facebook
google
linkedin
microsoft
palantir-technologies
pinterest
square
uber
vmware | |
Group Shifted Strings | Medium | amazon
facebook
google
uber | |
Second Highest Salary Problem | Medium | adobe
amazon
apple
bloomberg
ebay
facebook
google
microsoft
yahoo | |
Nth Highest Salary Problem | Medium | adobe
amazon
apple
google
uber | |
Predict the Winner Problem | Medium | amazon
apple
google
uber | |
Knight Probability in Chessboard Problem | Medium | amazon
apple
facebook
goldman-sachs
google
microsoft | |
Asteroid Collision Problem | Medium | amazon
bytedance
ebay
google
lyft
microsoft
paypal
uber
visa | |
Add Two Numbers represented as Linked List in Forward | Medium | amazon
apple
bloomberg
bytedance
cisco
ebay
facebook
goldman-sachs
google
microsoft
oracle
uber
yahoo | |
Course Schedule 1 - Is it Possible | Medium | amazon
apple
bloomberg
bytedance
cisco
cohesity
ebay
facebook
goldman-sachs
google
intuit
linkedin
microsoft
nutanix
oracle
paypal
salesforce
uber
wish
yahoo
yelp
zenefits | |
Course Schedule 2 - Get Ordered Courses | Medium | airbnb
amazon
apple
bloomberg
doordash
facebook
google
intuit
microsoft
nutanix
oracle
pinterest
snapchat
twitter
uber
wayfair
zenefits | |
All Nodes Distance K in Binary Tree | Medium | amazon
apple
bloomberg
bytedance
didi
facebook
google
hulu
microsoft
oracle
uber
yahoo | |
Single Number 2 - All elements except one occur thrice | Medium | adobe
amazon
facebook
google | |
Kth Largest Element in an Array | Medium | adobe
airbnb
alibaba
amazon
apple
atlassian
baidu
bloomberg
bytedance
ebay
expedia
facebook
goldman-sachs
google
grab
jpmorgan
linkedin
microsoft
oracle
pocket-gems
salesforce
snapchat
spotify
tencent
uber
vmware
yahoo | |
Divide Two Integers Problem | Medium | adobe
amazon
apple
bloomberg
context-logic
facebook
google
microsoft
oracle
riot-games | |
Minimum Absolute Difference in BST Problem | Easy | amazon
apple
google | |
Sort a Linked List | Medium | adobe
amazon
bytedance
facebook
google
microsoft | |
Dutch National Flag DNF | Medium | amazon
apple
bloomberg
ebay
facebook
google
linkedin
microsoft
oracle
paypal
pocket-gems
pure-storage
uber
vmware
yahoo | |
Longest Increasing Subsequence LIS Problem | Medium | adobe
amazon
apple
atlassian
ebay
facebook
google
microsoft
oracle
salesforce
uber
vmware | |
Sliding Window Maximum | Hard | adobe
alibaba
amazon
apple
bloomberg
bytedance
citadel
coursera
databricks
facebook
google
lyft
microsoft
nutanix
oracle
pinterest
roblox
twitter
uber
vmware
wish
yelp
zenefits | |
Unique BSTs 1 - Count | Medium | adobe
amazon
apple
bloomberg
expedia
facebook
google
microsoft
snapchat
wish | |
Container With Most Water | Medium | adobe
amazon
apple
bloomberg
bytedance
facebook
goldman-sachs
google
lyft
microsoft
oracle
uber
vmware
yahoo | |
Count Complete Tree Nodes Problem | Easy | amazon
bloomberg
bytedance
facebook
google
microsoft
yahoo | |
Longest Common Subsequence LCS 1 - Get Length | Medium | amazon
bytedance
facebook
google
indeed
microsoft
tencent | |
Lowest Common Ancestor of a Binary Tree | Medium | adobe
airbnb
amazon
apple
atlassian
bloomberg
bytedance
ebay
facebook
google
intuit
linkedin
microsoft
oracle
paypal
pinterest
salesforce
splunk
uber
visa
yahoo
zillow | |
Pascal’s Triangle 1 - Generate first n rows | Easy | adobe
amazon
apple
bloomberg
facebook
goldman-sachs
google
microsoft
twitter
uber | |
Skyline Problem | Hard | adobe
amazon
apple
databricks
facebook
goldman-sachs
google
houzz
microsoft
salesforce
tableau
twitter
uber
yelp | |
Binary Tree Inorder Traversal | Easy | alibaba
amazon
apple
bloomberg
bytedance
facebook
google
microsoft
oracle
sap
uber | |
Binary Tree Postorder Traversal | Easy | adobe
amazon
facebook
google
uber | |
Count Univalue Subtrees Problem | Medium | amazon
bloomberg
box
ebay
facebook
google | |
Generate Parentheses Problem | Medium | adobe
alibaba
amazon
apple
atlassian
bloomberg
bytedance
cisco
facebook
google
lyft
microsoft
nutanix
nvidia
salesforce
samsung
sap
snapchat
spotify
uber
yahoo
yandex
yelp
zenefits | |
Inorder Successor in Binary Search Tree | Medium | amazon
bloomberg
citadel
facebook
google
microsoft
palantir-technologies
pocket-gems
quip
zillow | |
Inorder Successor in Binary Search Tree Using Parent link | Medium | bloomberg
google
microsoft
quip | |
Unique Paths in Grid 1 - Count all paths moving right or down | Medium | adobe
alibaba
amazon
apple
bloomberg
facebook
goldman-sachs
google
mathworks
microsoft
oracle
snapchat
uber
vmware | |
Valid Parentheses Problem | Easy | adobe
airbnb
akuna-capital
amazon
apple
atlassian
audible
barclays
blizzard
bloomberg
cisco
citadel
doordash
ebay
epic-systems
expedia
facebook
godaddy
goldman-sachs
google
ibm
intel
intuit
jpmorgan
linkedin
liveramp
lyft
mathworks
microsoft
morgan-stanley
oracle
paypal
postmates
riot-games
salesforce
samsung
sap
servicenow
splunk
spotify
tencent
tesla
triplebyte
twilio
twitter
uber
visa
vmware
yahoo
yandex
zenefits
zillow | |
Last Stone Weight Problem | Easy | amazon
google | |
Climbing Stairs Problem 1 - Take atmost 2 Steps | Easy | adobe
alibaba
amazon
apple
baidu
bloomberg
citadel
facebook
goldman-sachs
google
huawei
linkedin
microsoft
nvidia
oracle
tripadvisor
uber
zulily | |
Convert Sorted Array to height-balanced Binary Search Tree | Easy | airbnb
amazon
apple
bloomberg
cisco
facebook
google
microsoft
oracle
yahoo | |
Copy List with Random Pointer | Medium | adobe
amazon
apple
bloomberg
capital-one
ebay
expedia
facebook
google
microsoft
nutanix
oracle
qualtrics
uber
visa
yahoo
snapchat | |
Intersection of Two Linked Lists Problem | Easy | airbnb
alibaba
amazon
apache-design
bloomberg
bytedance
cisco
ebay
expedia
facebook
goldman-sachs
google
linkedin
microsoft
morgan-stanley
netapp
oracle
qualcomm
redfin
sap
tencent
yahoo | |
Lowest Common Ancestor in a Binary Search Tree | Medium | adobe
amazon
bloomberg
cisco
facebook
google
linkedin
microsoft
oracle
twitter
uber | |
Maximal Square | Medium | adobe
airbnb
amazon
appdynamics
apple
bloomberg
citadel
facebook
google
huawei
microsoft
oracle
two-sigma
uber
vmware | |
Minimum Window Substring | Hard | adobe
airbnb
amazon
apple
bloomberg
bytedance
cohesity
deutsche-bank
directi
ebay
facebook
godaddy
goldman-sachs
google
linkedin
lyft
microsoft
nutanix
oracle
salesforce
snapchat
tencent
twitter
uber
visa
vmware
yahoo | |
N-Queens Problem | Hard | adobe
amazon
apple
bytedance
ebay
facebook
google
microsoft
oracle
rubrik
tableau
uber | |
Diameter Of a Binary Tree | Easy | adobe
amazon
apple
atlassian
baidu
bloomberg
bytedance
facebook
google
intel
microsoft
oracle
qualtrics
tencent | |
K Reverse a linked list | Hard | adobe
amazon
apple
bytedance
cisco
cohesity
ebay
facebook
google
mathworks
microsoft
paypal
vmware | |