Perfect number Problem | Easy | amazon
fallible | |
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 | |
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 | |
Cousins in Binary Tree Problem | Easy | adobe
amazon
bloomberg
facebook
goldman-sachs
microsoft | |
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 | |
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 Problem | Easy | amazon
apple
bloomberg
facebook
google
linkedin
microsoft | |
Sum of Left Leaves | Easy | adobe
amazon
bloomberg
expedia
facebook
google
mathworks | |
Binary Tree Preorder Traversal | Easy | amazon
bloomberg
cisco
google
microsoft | |
Best Time To Buy And Sell Stock 4 - at most k times | Hard | amazon
apple
bloomberg
facebook
google | |
Generate nth ugly number | Medium | amazon
oracle
uber | |
Palindrome Partitioning Problem | Medium | adobe
amazon
bloomberg
google
microsoft
qualtrics
uber
yahoo | |
Boats to Save People | Medium | amazon
factset
google | |
Find duplicate number in array containing n+1 numbers between 1 and n | Medium | adobe
amazon
apple
bloomberg
ebay
facebook
google
intuit
microsoft
oracle
salesforce
tencent
vmware | |
Candy distribution Problem | Hard | amazon
apple
google
microsoft
salesforce
uber | |
Binary Tree Level Order Traversal - Level by Level | Medium | adobe
amazon
apple
atlassian
bloomberg
cisco
citadel
ebay
expedia
facebook
google
linkedin
mathworks
microsoft
oracle
sap
uber
vmware
yahoo | |
Merge Two Sorted Linked Lists | Easy | adobe
airbnb
alibaba
amazon
apple
arista-networks
atlassian
bloomberg
bytedance
capital-one
cisco
ebay
facebook
google
huawei
indeed
intel
linkedin
lyft
microsoft
oracle
paypal
samsung
tencent
uber
visa
vmware
yahoo
yandex | |
Evaluate Reverse Polish Notation Problem | Medium | amazon
atlassian
facebook
google
linkedin
microsoft
opendoor
oracle
uber
vmware
yandex
zillow | |
Reverse Words in a String | Medium | amazon
apple
bloomberg
cisco
citadel
facebook
google
huawei
microsoft
nvidia
oracle
qualcomm
salesforce
snapchat
vmware
yelp
zillow | |
Longest Palindromic Substring Problem | Medium | adobe
airbnb
alibaba
amazon
appdynamics
apple
bloomberg
cisco
ebay
facebook
godaddy
google
huawei
jpmorgan
mathworks
microsoft
nutanix
oracle
paypal
pure-storage
roblox
samsung
sap
servicenow
tencent
uber
vmware
wayfair
yahoo
yandex | |
Subsets 1 Problem | Medium | adobe
amazon
apple
atlassian
bloomberg
bytedance
coupang
ebay
facebook
goldman-sachs
google
lyft
microsoft
uber
yahoo | |
Is Subsequence Problem | Easy | amazon
bloomberg
coursera
facebook
google
pinterest | |
Convert String to Integer atoi Problem | Medium | adobe
amazon
apple
bloomberg
cisco
citadel
ebay
facebook
goldman-sachs
google
linkedin
microsoft
nvidia
oracle
redfin
sap
tencent
uber
vmware
zillow | |
Majority Element 2 - With n by 3 definition | Medium | adobe
amazon
apple
bloomberg
facebook
google
microsoft
uber
zenefits | |
Contains Duplicate 1 - Check if array has duplicates | Easy | adobe
airbnb
amazon
apple
bloomberg
facebook
microsoft
oracle
palantir-technologies
yahoo | |
Count the number of elements from one array less than or equal to elements in another array | | amazon | |
Kth Smallest Element in a BST Problem | Medium | affirm
amazon
apple
bloomberg
facebook
google
hulu
microsoft
oracle
triplebyte
uber
vmware | |