| 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 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
|
|
|
| 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 |
Medium
|
amazon
apple
facebook
google
microsoft
twitter
uber
|
|
| The Maze 2 |
Medium
|
amazon
facebook
google
netease
oracle
|
|
| Count distinct binary trees for a given number of nodes |
Medium
|
|
|
| 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
|
|
|
| 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
|
|
|
| Find the Power of K-Size Subarrays 1 |
Medium
|
|
|
| Shortest Subarray to be Removed to Make Array Sorted |
Medium
|
|
|
| Minimized Maximum of Products Distributed to Any Store |
Medium
|
|
|
| Count the Number of Fair Pairs |
Medium
|
|
|
| Two Best Non-Overlapping Events |
Medium
|
|
|
| Maximum Earnings From Taxi |
Medium
|
|
|
| Most Beautiful Item for Each Query |
Medium
|
|
|
| Prime Subtraction Operation |
Medium
|
|
|
| Shortest Subarray With OR at Least K 2 |
Medium
|
|
|
| Minimum Array End |
Medium
|
|
|
| Maximum XOR for Each Query |
Medium
|
|
|
| Largest Combination With Bitwise AND Greater Than Zero |
Medium
|
|
|
| Find if Array Can Be Sorted |
Medium
|
|
|
| Minimum Number of Changes to Make Binary String Beautiful |
Medium
|
|
|
| String Compression 3 |
Medium
|
|
|
| Maximum Number of Moves in a Grid |
Medium
|
|
|
| Longest Square Streak in an Array |
Medium
|
|
|