| 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
|
|
| Number of Connected Components in an Undirected Graph |
Medium
|
amazon
facebook
google
linkedin
microsoft
twitter
|
|
| Number of elements smaller than root in preorder traversal of a BST |
Medium
|
|
|
| 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
|
|
| Postorder Node Iterator of Binary Tree |
Medium
|
|
|
| Power of Three |
Easy
|
apple
goldman-sachs
google
hulu
|
|
| Print or return all leaf nodes of a binary tree |
Easy
|
|
|
| Print or return all the full nodes in a binary tree |
Easy
|
|
|
| Print or return ancestors of a given node in binary tree |
Medium
|
|
|
| Print or return nodes between two given levels in a binary tree |
Medium
|
|
|
| Pseudo-Palindromic Paths in a Binary Tree |
Medium
|
amazon
|
|
| Range Sum Query - Immutable |
Easy
|
amazon
bloomberg
facebook
goldman-sachs
google
microsoft
palantir-technologies
|
|
| Rectangle Area 2 |
Hard
|
google
sumologic
|
|
| Replace each node in BST with subtree sum and its value |
Medium
|
|
|
| Right side view of a tree |
Medium
|
|
|