Implement 3 stacks in 1 list | Hard | microsoft | |
Check if target word exists in matrix horizontally or vertically | Easy | microsoft | |
Expected number of rounds to reach one remaining coin | Easy | microsoft | |
Find Largest Value in Each Tree Row Problem | Medium | amazon
apple
facebook
linkedin
microsoft | |
Construct Binary Search Tree BST from Preorder Traversal | Medium | amazon
facebook
microsoft
oracle | |
K closest Points to Origin | Medium | amazon
apple
asana
ebay
expedia
facebook
goldman-sachs
google
linkedin
microsoft
oracle
paypal
uber
visa
yahoo | |
Range Sum Query - Immutable | Easy | amazon
bloomberg
facebook
google
microsoft
palantir-technologies
goldman-sachs | |
Robot Room Cleaner | Hard | amazon
facebook
google
microsoft | |
Target Sum Problem | Medium | facebook
google
microsoft | |
Binary Tree Path - All root to leaf paths | Easy | adobe
amazon
apple
facebook
google
microsoft | |
Sliding Puzzle Problem | Hard | airbnb
amazon
facebook
google
microsoft
uber | |
Diagonal Traverse Problem | Medium | amazon
apple
ebay
facebook
google
microsoft
quora
splunk | |
Maximum Swap Problem | Medium | amazon
apple
bytedance
facebook
microsoft
uber | |
Smallest Range Covering Elements from K Lists Problem | Hard | amazon
apple
facebook
google
lyft
microsoft
pinterest
snapchat | |
Design a Stack With Increment Operation Problem | Medium | microsoft | |
Uncommon Words from Two Sentences Problem | Easy | amazon
expedia
facebook
microsoft | |
Find the Longest Substring Containing Vowels in Even Counts Problem | Medium | microsoft | |
Read N characters given read7 | Easy | microsoft | |
Water Bottles Problem | Easy | microsoft | |
Merge Nodes in Between Zeros Problem | Medium | microsoft | |
Nth Number with sum of digits as 10 | Easy | microsoft | |
Relative Sort Array Problem | Easy | amazon
de-shaw
ebay
google
microsoft | |
Max Stack Problem | Hard | amazon
bloomberg
facebook
google
linkedin
lyft
microsoft
pure-storage
snapchat
twitter | |
Distribute Coins in Binary Tree Problem | Medium | amazon
facebook
google
microsoft
uber | |
Permutations of Array 2 - Array has duplicates | Medium | adobe
amazon
apple
bloomberg
facebook
linkedin
microsoft
uber
vmware | |
Continuous Subarray Sum | Medium | amazon
bytedance
facebook
google
microsoft
samsung | |
Implement Power Function 1 | Medium | adobe
amazon
apple
asana
bloomberg
ebay
facebook
goldman-sachs
google
linkedin
microsoft
morgan-stanley
oracle
uber
vmware | |
Missing Number Problem | Easy | adobe
amazon
apple
arista-networks
bloomberg
facebook
google
ibm
microsoft
oracle
servicenow
vmware
zillow | |
Reverse Integer Problem | Medium | adobe
amazon
apple
barclays
bloomberg
cisco
facebook
google
jpmorgan
lyft
microsoft
netease
oracle
uber
yahoo | |
Palindrome Number Problem | Easy | adobe
amazon
apple
bloomberg
facebook
google
hcl
jpmorgan
microsoft
oracle
yahoo | |
Friend Words - One Edit Distance | Medium | amazon
facebook
google
microsoft
snapchat
twitter
uber | |
Longest Duplicate Substring Problem | Hard | amazon
apple
google
microsoft
oracle | |
Shortest Common Supersequence Problem | Hard | microsoft | |
Balanced Binary Tree Problem | Easy | adobe
amazon
apple
bloomberg
bytedance
cisco
facebook
google
microsoft | |
Binary Tree Path Sum - Maximum Sum between any nodes | Hard | adobe
amazon
appdynamics
apple
baidu
bloomberg
bytedance
facebook
google
intuit
microsoft
twitter
uber
vmware | |
Binary Tree Traversal - Zigzag Level Order Traversal | Medium | amazon
apple
bloomberg
bytedance
ebay
facebook
google
linkedin
microsoft
oracle
qualtrics
samsung
servicenow
yahoo | |
Construct Binary Tree from Inorder and Postorder Traversal | Medium | amazon
bloomberg
facebook
google
mathworks
microsoft
twitter | |
Construct Binary Tree from Inorder and Preorder Traversal | Medium | adobe
amazon
apple
bloomberg
bytedance
citadel
facebook
google
microsoft
oracle
square
twitter
yahoo | |
Contains Duplicate 2 - within k distance | Easy | adobe
airbnb
amazon
apple
bloomberg
google
microsoft
palantir-technologies | |
Contains Duplicate 3 - within k distance and t difference | Hard | adobe
airbnb
apple
google
microsoft
palantir-technologies | |
Convert Sorted List into a height-balanced Binary search Tree | Medium | amazon
bloomberg
facebook
google
lyft
microsoft
oracle
vmware
zenefits | |
Count of Smaller Numbers After Self Problem | Hard | adobe
amazon
apple
bloomberg
facebook
google
microsoft
oracle
uber | |
Count Primes | Medium | adobe
amazon
apple
bloomberg
capital-one
ebay
facebook
goldman-sachs
google
intel
microsoft
oracle
yahoo
yandex | |
Find Median from Data Stream | Hard | adobe
amazon
apple
atlassian
bloomberg
bytedance
citadel
ebay
expedia
facebook
goldman-sachs
google
microsoft
netflix
oracle
pinterest
qualtrics
salesforce
snapchat
twitter
uber
vmware
yahoo | |
Find Peak Element in a Given Array | Medium | amazon
apple
bloomberg
bytedance
facebook
google
ixl
lyft
microsoft
quora
uber
vmware
yahoo | |
Find the Closest Palindrome Problem | Hard | amazon
facebook
google
microsoft
nutanix
pinterest
uber
yelp | |
Finding N-th Smallest Sum from Two Sorted Arrays | | microsoft | |
First Unique Character in a Stream of Characters | Medium | amazon
google
microsoft | |
Generate Nth Fibonacci Number | Easy | amazon
apple
barclays
facebook
mathworks
microsoft
sap
yahoo | |
Gray Code | Medium | amazon
microsoft
apple | |