| Missing Element in Sorted Array |
Medium
|
amazon
apple
bloomberg
facebook
google
lyft
|
|
| Shortest Distance After Road Addition Queries I |
Medium
|
|
|
| Split BST |
Medium
|
amazon
coupang
facebook
google
|
|
| Pour Water |
Medium
|
airbnb
robinhood
|
|
| IP to CIDR |
Medium
|
airbnb
|
|
| Candy Crush |
Medium
|
bloomberg
facebook
google
rubrik
twitch
|
|
| Search in a Sorted Array of Unknown Size |
Medium
|
amazon
ebay
google
microsoft
|
|
| Path Sum IV |
Medium
|
alibaba
|
|
| Minimum Factorization |
Medium
|
tencent
|
|
| Shortest Distance in a Plane |
Medium
|
microsoft
|
|
| Friend Requests II - Who Has the Most Friends |
Medium
|
facebook
|
|
| Get Highest Answer Rate Question |
Medium
|
facebook
|
|
| Kill Process |
Medium
|
amazon
apple
bloomberg
google
|
|
| Squirrel Simulation |
Medium
|
square
|
|
| Winning Candidate |
Medium
|
|
|
| Longest Line of Consecutive One in Matrix |
Medium
|
google
|
|
| Binary Tree Longest Consecutive Sequence II |
Medium
|
amazon
apple
facebook
google
|
|
| Construct Binary Tree from String |
Medium
|
amazon
facebook
|
|
| Lonely Pixel I |
Medium
|
google
|
|
| Find Permutation |
Medium
|
google
|
|
| Binary Tree Path Sum - Find all paths between any two nodes value |
Medium
|
|
|
| Binary Tree Path Sum - Maximum between any two leaves |
Medium
|
|
|
| Binary Tree Path Sum - Maximum Sum Leaf to Root path |
Medium
|
|
|
| Binary Tree Path Sum - Maximum Sum Root to Leaf path |
Medium
|
|
|
| Brick Wall |
Medium
|
adobe
bloomberg
facebook
google
oracle
|
|
| Check if Tree is Full Binary Tree |
Medium
|
|
|
| Check if two binary trees are mirror images of each other |
Medium
|
|
|
| Check if two nodes in a binary tree are siblings |
Medium
|
|
|
| Closest leaf to root in a binary tree |
Medium
|
|
|
| Construct ancestor matrix from a binary tree |
Medium
|
|
|
| Construct binary tree from an ancestor matrix |
Medium
|
|
|
| Convert binary tree to its Sum tree |
Medium
|
|
|
| Convert Heap ordered Linked List to Binary Tree |
Medium
|
|
|
| Delete a binary tree completely |
Medium
|
|
|
| Diameter Of a N-Ary Tree |
Medium
|
facebook
google
|
|
| Distance between two nodes in binary tree |
Medium
|
amazon
|
|
| Find distance from root to given node in binary tree |
Medium
|
|
|
| Find path from root to given node in a binary tree |
Medium
|
|
|
| Flatten Binary Search Tree to Circular Doubly Linked List |
Medium
|
|
|
| Flatten Binary tree to double linked list in-place |
Medium
|
|
|
| Improve search in BST with sentinel |
Medium
|
|
|
| Inorder predecessor and successor of a node in binary search tree |
Medium
|
|
|
| Is Graph Bipartite |
Medium
|
amazon
dropbox
ebay
facebook
google
linkedin
liveramp
microsoft
uber
|
|
| Minimum Number Of Platforms For Train Station |
Medium
|
|
|
| Optimal binary search tree construction for minimum search cost |
Medium
|
|
|
| Partition Array for Maximum Sum Problem |
Medium
|
facebook
|
|
| Range Max Query |
Medium
|
|
|
| Shortest Unique Prefix |
Medium
|
google
square
|
|
| Subarray Product Less Than K |
Medium
|
akuna-capital
atlassian
coursera
expedia
google
yatra
|
|
| Target Sum |
Medium
|
facebook
google
microsoft
|
|