Smallest positive integer that cannot be represented as the sum of a subset of a sorted array |
Easy
|
amazon
|
|
Length of Longest Fibonacci Subsequence |
Medium
|
amazon
baidu
|
|
Construct Binary Tree from Preorder and Postorder Traversal |
Medium
|
amazon
bloomberg
facebook
google
uber
|
|
Recover a Tree From Preorder Traversal |
Hard
|
amazon
linkedin
|
|
Making A Large Island |
Hard
|
amazon
facebook
google
uber
|
|
Count Servers that Communicate |
Medium
|
amazon
google
|
|
Busiest period in a building |
Easy
|
amazon
|
|
Word Subsets |
Medium
|
amazon
facebook
google
|
|
Implement a bit array |
Medium
|
amazon
|
|
String Matching in an Array |
Easy
|
amazon
|
|
Break a string into lines of length k without breaking words |
Medium
|
amazon
|
|
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
|
|
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
|
|
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
|
|
Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree |
Medium
|
amazon
|
|
Closest Leaf in a Binary Tree |
Medium
|
amazon
databricks
facebook
google
|
|
Interval List Intersections |
Medium
|
amazon
apple
bloomberg
cruise-automation
doordash
facebook
google
oracle
pinterest
snapchat
uber
|
|
Partition Array According to Given Pivot |
Medium
|
amazon
|
|
Distance between two nodes in binary tree |
Medium
|
amazon
|
|
Is Graph Bipartite |
Medium
|
amazon
dropbox
ebay
facebook
google
linkedin
liveramp
microsoft
uber
|
|
Rectangle Overlap |
Easy
|
adobe
amazon
apple
bloomberg
goldman-sachs
google
mathworks
microsoft
oracle
|
|
Robot Room Cleaner |
Hard
|
amazon
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
|
|
Shortest Subarray with Sum at Least K Problem |
Hard
|
amazon
facebook
goldman-sachs
google
|
|
Remove Sub-Folders from the Filesystem Problem |
Medium
|
amazon
facebook
google
|
|
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
|
|
Minimum Add to Make Parentheses Valid Problem |
Medium
|
amazon
facebook
servicenow
|
|
Sentence Similarity 2 - with transitive word pairs |
Medium
|
amazon
bloomberg
google
|
|
Uncommon Words from Two Sentences Problem |
Easy
|
amazon
expedia
facebook
microsoft
|
|