| Intersection of Two Arrays 2 - Duplicates allowed | Easy | amazon
apple
bloomberg
bytedance
databricks
facebook
google
linkedin
microsoft
oracle
salesforce
uber
yandex | |
| Intersection of Two Arrays 1 - Unique Elements | Easy | amazon
apple
bloomberg
bytedance
facebook
google
indeed
jpmorgan
linkedin
lyft
microsoft
oracle
two-sigma
uber
yelp | |
| Design Tic-Tac-Toe | Medium | amazon
apple
bloomberg
doordash
facebook
google
microsoft
salesforce
triplebyte
uber | |
| Longest Substring with At Most K Distinct Characters | Medium | amazon
appdynamics
bloomberg
citadel
coupang
facebook
google
microsoft
oracle
snapchat
uber
wish | |
| Minimum Height Trees | Medium | amazon
apple
bloomberg
facebook
google
snapchat | |
| Longest Consecutive Sequence | Medium | adobe
amazon
apple
bloomberg
facebook
google
microsoft
nutanix
oracle
paypal
spotify
uber
wish | |
| Second Highest Salary Problem | Medium | adobe
amazon
apple
bloomberg
ebay
facebook
google
microsoft
yahoo | |
| Big Countries Problem | Easy | adobe
bloomberg | |
| Add Two Numbers represented as Linked List in Forward order | 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 | |
| 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 | Medium | adobe
amazon
apple
bloomberg
context-logic
facebook
google
microsoft
oracle
riot-games
nextdoor | |
| 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 | Easy | amazon
bloomberg
bytedance
facebook
google
microsoft
yahoo | |
| Counting Bits | Easy | amazon
apple
bloomberg
facebook
mathworks
microsoft
uber
pivotal | |
| Jump Game 1 - Check if it reaches last index | Medium | adobe
amazon
apple
bloomberg
bytedance
facebook
google
microsoft
nutanix
oracle
postmates
uber
vmware
pinterest | |
| 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 | |
| Word Ladder 1 - Get Ladder Length | Hard | affirm
amazon
apple
audible
bloomberg
cohesity
expedia
facebook
google
linkedin
lyft
microsoft
oracle
pinterest
qualtrics
salesforce
samsung
servicenow
snapchat
spotify
square
tesla
uber
vmware
yelp
zillow | |
| Binary Tree Inorder Traversal | Easy | alibaba
amazon
apple
bloomberg
bytedance
facebook
google
microsoft
oracle
sap
uber | |
| Count Univalue Subtrees | Medium | amazon
bloomberg
box
ebay
facebook
google | |
| Generate Parentheses | 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 | 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 | |
| Longest Palindromic Subsequence 1 - Get Length | Medium | amazon
apple
bloomberg
facebook
linkedin
microsoft
uber
google | |
| Maximum Width of Binary Tree | Medium | amazon
bloomberg
ebay
facebook
google
microsoft
uber | |
| Cousins in Binary Tree | Easy | adobe
amazon
bloomberg
facebook
goldman-sachs
microsoft
yext | |
| Climbing Stairs - 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
snapchat
uber
visa
yahoo | |
| Intersection of Two Linked Lists | 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 of 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 Path Sum in matrix | Medium | adobe
amazon
apple
bloomberg
dropbox
facebook
goldman-sachs
google
microsoft
nvidia
rubrik
uber
wish | |
| 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 | |
| Binary Tree Right Side View | Medium | adobe
amazon
apple
atlassian
bloomberg
bytedance
citadel
ebay
facebook
google
mathworks
microsoft
nvidia
oracle
paypal
sap
uber
vmware | |
| Diameter Of a Binary Tree | Easy | adobe
amazon
apple
atlassian
baidu
bloomberg
bytedance
facebook
google
intel
microsoft
oracle
qualtrics
tencent | |
| Linked List Cycle 1 - Detect Cycle | Easy | adobe
amazon
apple
bloomberg
cisco
ebay
facebook
goldman-sachs
google
linkedin
microsoft
oracle
vmware
yahoo | |
| Maximum Depth of Binary Tree | Easy | adobe
amazon
apple
bloomberg
bytedance
facebook
goldman-sachs
google
linkedin
microsoft
paypal
sap
uber
yahoo | |
| Populate next pointer to right node in Perfect Binary Tree | Medium | amazon
apple
bloomberg
didi
facebook
google
microsoft
nutanix
oracle
sap
vmware | |
| Same Tree | Easy | amazon
apple
bloomberg
facebook
google
linkedin
microsoft | |
| Search a 2D Matrix 2 - Rows and columns are sorted | Medium | adobe
amazon
apple
baidu
bloomberg
bytedance
citadel
ebay
expedia
facebook
goldman-sachs
google
linkedin
microsoft
oracle
paypal
salesforce
sap
tencent
yahoo | |
| Sum of Left Leaves | Easy | adobe
amazon
bloomberg
expedia
facebook
google
mathworks | |
| Binary Tree Preorder Traversal | Easy | amazon
bloomberg
cisco
google
microsoft | |