| Check if an element exists in a binary tree |
Easy
|
|
|
| Check if postordered array forms a binary search tree |
Medium
|
|
|
| Construct Binary Search Tree BST from Preorder Traversal |
Medium
|
amazon
facebook
microsoft
oracle
|
|
| Construct reverse sum hierarchy triangle from an array |
Medium
|
|
|
| Convert a sorted doubly linked list DLL to balanced binary search tree |
Medium
|
|
|
| Convert a sorted doubly linked list DLL to balanced binary search tree in-place |
Medium
|
|
|
| Convert Binary Tree into Threaded Binary Tree |
Hard
|
|
|
| Count Good Nodes in Binary Tree |
Medium
|
microsoft
|
|
| Create Sorted Array through Instructions |
Hard
|
|
|
| De Bruijn Sequence |
Hard
|
LinkedIn
|
|
| Delete in a Binary Search Tree |
Medium
|
amazon
apple
bloomberg
cisco
facebook
google
linkedin
microsoft
oracle
uber
yahoo
|
|
| Delivering Boxes from Storage to Ports |
Hard
|
|
|
| Duplicate each node in a binary search tree and add as its left child |
Easy
|
|
|
| Evaluate an expression tree and generate a parenthesised form |
Medium
|
|
|
| Falling Squares |
Hard
|
amazon
square
uber
|
|
| Fancy Sequence |
Hard
|
|
|
| Find a Corresponding Node of a Binary Tree in a Clone of That Tree |
Easy
|
facebook
|
|
| Find a Value of a Mysterious Function Closest to Target |
Hard
|
|
|
| Find Bottom Left Tree Value |
Medium
|
bloomberg
microsoft
|
|
| Find Eventual Safe States |
Medium
|
google
|
|
| Find GCD of n numbers |
Easy
|
amazon
|
|
| Find K Closest Elements |
Medium
|
amazon
apple
bloomberg
ebay
facebook
google
microsoft
snapchat
uber
|
|
| Find Leaves of Binary Tree |
Medium
|
amazon
atlassian
ebay
google
linkedin
pocket-gems
|
|
| Find nodes in binary tree without siblings |
Medium
|
|
|
| Find Size of Binary Tree |
Medium
|
|
|
| Find the depth of a node in a binary tree |
Medium
|
|
|
| Find the height of a node in a binary tree |
Medium
|
|
|
| Flatten binary tree to linked list in order of inorder traversal |
Medium
|
|
|
| Given preorder traversal of a BST, check if each non-leaf node has only one child |
Medium
|
|
|
| Implement circular linked list |
|
|
|
| Implement Hierarchical Locking System for Tree Structures |
Medium
|
|
|
| Implement queue using linked list |
Easy
|
|
|
| Implementing a queue using a fixed-size array |
Easy
|
|
|
| Insert into a Binary Search Tree |
Medium
|
amazon
atlassian
facebook
google
microsoft
|
|
| Interval Scheduling Problem |
Medium
|
|
|
| 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
|
|
| Left side view of a tree |
Medium
|
|
|
| Longest Substring of One Repeating Character |
Hard
|
|
|
| Longest Substring with Same Letters after Replacement |
Medium
|
bloomberg
google
pocket-gems
|
|
| Maximum Binary Tree |
Medium
|
amazon
facebook
google
microsoft
|
|
| Maximum in a Binary Search Tree |
Easy
|
|
|
| Maximum in a Binary Tree |
Easy
|
|
|
| Min Queue |
Easy
|
|
|
| Minimum in a Binary Search Tree |
Easy
|
|
|
| Minimum Possible Integer After at Most K Adjacent Swaps On Digits |
Hard
|
|
|
| My Calendar 3 |
Hard
|
amazon
google
|
|
| Nodes at Distance k from Leaf Nodes in Binary Tree |
Medium
|
|
|
| Nodes at Distance k from root in Binary Tree |
Medium
|
|
|
| Non-overlapping Intervals |
Medium
|
amazon
apple
bloomberg
facebook
google
microsoft
stripe
|
|