| 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
|
|
| K-diff Pairs in an Array |
Medium
|
amazon
bloomberg
goldman-sachs
microsoft
oracle
paypal
salesforce
twilio
twitter
|
|
| K-Similar Strings |
Hard
|
amazon
google
|
|
| Largest Unique Number |
Easy
|
amazon
|
|
| Logical OR of Two Binary Grids Represented as Quad-Trees |
Medium
|
amazon
google
sumologic
|
|
| Longest Repeating Substring |
Medium
|
amazon
facebook
google
microsoft
|
|
| Longest Word in Dictionary |
Medium
|
amazon
goldman-sachs
google
pinterest
|
|
| Max Consecutive Ones |
Easy
|
amazon
google
microsoft
|
|
| Max Consecutive Ones III |
Medium
|
amazon
facebook
microsoft
yandex
|
|
| Maximize Distance to Closest Person |
Medium
|
amazon
google
|
|
| Maximize Sum Of Array After K Negations |
Easy
|
amazon
druva
|
|
| Maximum Average Subtree |
Medium
|
amazon
atlassian
|
|
| Maximum Depth of N-ary Tree |
Easy
|
amazon
bloomberg
google
sap
|
|
| Maximum Number of Vowels in a Substring of Given Length |
Medium
|
amazon
|
|
| Minimum Area Rectangle II |
Medium
|
amazon
facebook
google
|
|
| Minimum Cost to Connect Sticks |
Medium
|
amazon
google
|
|
| Minimum Knight Moves |
Medium
|
amazon
apple
facebook
google
indeed
microsoft
oracle
|
|
| Minimum Number of K Consecutive Bit Flips |
Hard
|
akuna
akuna-capital
amazon
facebook
|
|
| Minimum Swaps to Make Strings Equal |
Medium
|
amazon
jp-morgan-chase
|
|
| Minimum Window Subsequence |
Hard
|
amazon
bloomberg
ebay
google
houzz
microsoft
|
|
| Next Closest Time |
Medium
|
adobe
amazon
bytedance
facebook
google
microsoft
uber
|
|
| Next Greater Node In Linked List |
Medium
|
amazon
facebook
microsoft
uber
|
|