| 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 | | |
| Implement queue using resizing array | Easy | | |
| 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 | |
| Minimize Malware Spread | Hard | amazon
bloomberg
dropbox
google | |
| Minimum Length Root to Leaf Binary Tree Path for Given Sum | Medium | | |
| Minimum Length Root to Leaf BST Path for Given Sum | Medium | | |
| 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 | | |
| Range Module | Hard | amazon
coupang
google
linkedin
machine-zone
oracle | |
| Rectangle Overlap | Easy | adobe
amazon
apple
bloomberg
goldman-sachs
google
mathworks
microsoft
oracle | |
| Remove Boxes | Hard | apple
tencent | |
| Reverse Pairs | Hard | amazon
bytedance
google
microsoft
uber | |
| Robot Room Cleaner | Hard | amazon
facebook
google
microsoft | |
| 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 | |
| The Maze 1 - Can the Ball Stop at Destination | Medium | amazon
apple
facebook
google
microsoft
twitter
uber | |
| The Maze 2 - Shortest Distance | Medium | amazon
facebook
google
netease
oracle | |
| The Maze 3 - Shortest Instructions to Reach the Hole | Hard | google | |
| Transformations Between Binary Tree Structuctures and Linked Lists | | | |
| Binary Tree Path - All root to leaf paths | Easy | adobe
amazon
apple
facebook
google
microsoft | |
| Closest Binary Search Tree Value | Easy | amazon
bloomberg
facebook
google
linkedin
microsoft
snapchat | |
| Closest Binary Search Tree Value II | Hard | amazon
facebook
forusall
google
linkedin | |
| Count distinct binary trees for a given number of nodes | Medium | | |
| Employee Free Time | Hard | airbnb
amazon
bloomberg
coupang
doordash
facebook
google
intuit
microsoft
pinterest
postmates
uber
wayfair | |
| Maximum CPU Load For Running Tasks | Medium | | |
| Replace the Substring for Balanced String | Medium | accolite | |
| Validate Binary Tree Nodes | Medium | facebook | |
| Find Champion II | Medium | | |
| Sliding Puzzle | Hard | airbnb
amazon
facebook
google
microsoft
uber | |
| Maximum Matrix Sum | Medium | | |
| Implement circular stack | Medium | | |
| Rotating the Box | Medium | | |
| Flip Columns For Maximum Number of Equal Rows | Medium | | |
| Count Unguarded Cells in the Grid | Medium | | |
| Take K of Each Character From Left and Right | Medium | | |
| Maximum Sum of Distinct Subarrays With Length K | Medium | | |