| Find Largest Value in Each Tree Row Problem |
Medium
|
amazon
apple
facebook
linkedin
microsoft
|
|
| Alien Dictionary |
Hard
|
airbnb
amazon
apple
bloomberg
cohesity
doordash
facebook
flipkart
google
microsoft
pinterest
pocket-gems
snapchat
square
twitter
uber
vmware
|
|
| Binary Search Tree BST Operations - Delete |
Medium
|
amazon
apple
bloomberg
cisco
facebook
google
linkedin
microsoft
oracle
uber
yahoo
|
|
| Binary Search Tree BST Operations - Insert |
Medium
|
amazon
atlassian
facebook
google
microsoft
|
|
| Binary Tree Pruning |
Medium
|
amazon
buffer-box
capital-one
google
hulu
twitter
|
|
| Construct Binary Search Tree BST from Preorder Traversal |
Medium
|
amazon
facebook
microsoft
oracle
|
|
| Falling Squares |
Hard
|
amazon
square
uber
|
|
| Find GCD of n numbers |
Easy
|
amazon
|
|
| Find Leaves of Binary Tree |
Medium
|
amazon
atlassian
ebay
google
linkedin
pocket-gems
|
|
| K closest Points to Origin |
Medium
|
amazon
apple
asana
ebay
expedia
facebook
goldman-sachs
google
linkedin
microsoft
oracle
paypal
uber
visa
yahoo
|
|
| Largest Divisible Subset |
Medium
|
adobe
amazon
google
|
|
| Maximum Binary Tree |
Medium
|
amazon
facebook
google
microsoft
|
|
| My Calendar 3 |
Hard
|
amazon
google
|
|
| Non-overlapping Intervals |
Medium
|
amazon
apple
bloomberg
facebook
google
microsoft
stripe
|
|
| Number of Connected Components in an Undirected Graph |
Medium
|
amazon
facebook
google
linkedin
microsoft
twitter
|
|
| Pacific Atlantic Water Flow |
Medium
|
amazon
apple
bloomberg
facebook
google
microsoft
oracle
|
|
| Palindromic Substrings |
Medium
|
adobe
amazon
apple
atlassian
citadel
coursera
facebook
goldman-sachs
google
linkedin
mathworks
microsoft
pure-storage
roblox
twitter
uber
vmware
|
|
| Plus One 2 - Given number as Linked List plus one |
Medium
|
amazon
google
|
|
| Pseudo-Palindromic Paths in a Binary Tree |
Medium
|
amazon
|
|
| Range Sum Query - Immutable |
Easy
|
amazon
bloomberg
facebook
goldman-sachs
google
microsoft
palantir-technologies
|
|
| Sum of Two Integers |
Medium
|
amazon
apple
facebook
google
hulu
|
|
| Task Scheduler |
Medium
|
amazon
apple
bloomberg
facebook
google
microsoft
nutanix
oracle
pinterest
uber
vmware
|
|
| Top K Frequent Elements |
Medium
|
amazon
apple
bloomberg
bytedance
ebay
facebook
goldman-sachs
google
hulu
linkedin
microsoft
oracle
pocket-gems
snapchat
spotify
uber
vmware
yahoo
yelp
|
|
| All People Report to the Given Manager |
Medium
|
amazon
google
|
|
| Average Selling Price |
Easy
|
amazon
|
|
| Boundary of Binary Tree |
Medium
|
adobe
amazon
apple
audible
ebay
google
microsoft
oracle
|
|
| Building H2O |
Medium
|
amazon
linkedin
|
|
| Campus Bikes II |
Medium
|
amazon
google
|
|
| Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree |
Medium
|
amazon
|
|
| Clone Binary Tree With Random Pointer |
Medium
|
amazon
|
|
| Closest Divisors |
Medium
|
amazon
|
|
| Closest Leaf in a Binary Tree |
Medium
|
amazon
databricks
facebook
google
|
|
| Customers Who Bought All Products |
Medium
|
amazon
|
|
| Cut Off Trees for Golf Event |
Hard
|
amazon
|
|
| Design Excel Sum Formula |
Hard
|
amazon
microsoft
|
|
| Design Log Storage System |
Medium
|
amazon
google
snapchat
twitter
|
|
| DI String Match |
Easy
|
amazon
goldman-sachs
google
|
|
| Dinner Plate Stacks |
Hard
|
amazon
bytedance
|
|
| Equal Tree Partition |
Medium
|
amazon
facebook
|
|
| Exam Room |
Medium
|
amazon
facebook
google
quip
quora
uber
|
|
| Find Mode in Binary Search Tree |
Easy
|
amazon
google
|
|
| Find N Unique Integers Sum up to Zero |
Easy
|
amazon
facebook
microsoft
|
|
| Find the Derangement of An Array |
Medium
|
amazon
ixl
|
|
| Find the Index of the Large Integer |
Medium
|
amazon
|
|
| First Unique Number |
Medium
|
amazon
|
|
| Global and Local Inversions |
Medium
|
amazon
|
|
| High Five |
Easy
|
amazon
goldman-sachs
|
|
| Insert into a Sorted Circular Linked List |
Medium
|
amazon
bloomberg
facebook
google
microsoft
quip
|
|
| Insufficient Nodes in Root to Leaf Paths |
Medium
|
amazon
|
|
| Jewels and Stones |
Easy
|
adobe
amazon
apple
facebook
google
yahoo
|
|