| Game Play Analysis I |
Easy
|
gsn-games
|
|
| Find Total Time Spent by Each Employee Problem |
Easy
|
|
|
| Immediate Food Delivery I |
Easy
|
doordash
|
|
| The number of Rich Customers Problem |
Easy
|
|
|
| Recyclable and Low Fat Products Problem |
Easy
|
|
|
| Shortest Word Distance 1 |
Easy
|
amazon
google
linkedin
microsoft
oracle
paypal
uber
vmware
|
|
| 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
|
|
| Rearrange Products Table Problem |
Easy
|
|
|
| Delete Duplicate Emails Problem |
Easy
|
amazon
|
|
| Leetcode 1527 - Patients With a Condition |
Easy
|
|
|
| Find Users With Valid E-Mails Problem |
Easy
|
|
|
| Leetcode 1667 - Fix Names in a Table |
Easy
|
|
|
| Leetcode 1873 - Calculate Special Bonus |
Easy
|
|
|
| Leetcode 1683 - Invalid Tweets |
Easy
|
|
|
| Leetcode 1148 - Article Views I |
Easy
|
linkedin
|
|
| Ad-Free Sessions Problem |
Easy
|
|
|
| Customers Who Never Order Problem |
Easy
|
amazon
|
|
| Big Countries Problem |
Easy
|
adobe
bloomberg
|
|
| Minimum Depth of Binary Tree |
Easy
|
amazon
apple
facebook
microsoft
|
|
| Minimum Absolute Difference in BST Problem |
Easy
|
amazon
apple
google
|
|
| Perfect number Problem |
Easy
|
amazon
fallible
|
|
| Count Complete Tree Nodes |
Easy
|
amazon
bloomberg
bytedance
facebook
google
microsoft
yahoo
|
|
| Counting Bits |
Easy
|
amazon
apple
bloomberg
facebook
mathworks
microsoft
uber
|
|
| Pascal’s Triangle 1 - Generate first n rows |
Easy
|
adobe
amazon
apple
bloomberg
facebook
goldman-sachs
google
microsoft
twitter
uber
|
|
| Search in a Binary Search Tree |
Easy
|
adobe
apple
google
ibm
|
|
| Transpose of a Matrix |
Easy
|
apple
microsoft
servicenow
|
|
| 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
|
|
| 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
|
|
| Last Stone Weight Problem |
Easy
|
amazon
google
|
|
| Cousins in Binary Tree Problem |
Easy
|
adobe
amazon
bloomberg
facebook
goldman-sachs
microsoft
|
|
| Implement stack using priority queue |
Easy
|
adobe
microsoft
amazon
|
|
| Climbing Stairs 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
|
|
| 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
|
|
| 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
|
|
| Same Tree |
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
|
|
| Find Second largest element in an array |
Easy
|
|
|
| Find Deepest Node in a Binary Tree |
Easy
|
google
uber
|
|
| 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
|
|
| Is Subsequence Problem |
Easy
|
amazon
bloomberg
coursera
facebook
google
pinterest
|
|
| Majority Element 1 - with n by 2 definition |
Easy
|
facebook
google
microsoft
yahoo
|
|
| Contains Duplicate 1 - Check if array has duplicates |
Easy
|
adobe
airbnb
amazon
apple
bloomberg
facebook
microsoft
oracle
palantir-technologies
yahoo
|
|
| Subtree of Another Tree |
Easy
|
amazon
bloomberg
ebay
facebook
google
microsoft
samsung
|
|
| Longest Common Prefix in array of string |
Easy
|
adobe
alibaba
amazon
apple
bloomberg
cisco
ebay
facebook
google
ibm
ixl
microsoft
oracle
pinterest
quora
snapchat
splunk
twilio
visa
yelp
|
|