| Move Pieces to Obtain a String Problem |
Medium
|
|
|
| Binary Search Tree BST Operations - Delete |
Medium
|
amazon
apple
bloomberg
cisco
facebook
google
linkedin
microsoft
oracle
uber
yahoo
|
|
| Binary Search Tree BST Operations - Insert |
Medium
|
amazon
atlassian
facebook
google
microsoft
|
|
| Binary Tree Pruning |
Medium
|
amazon
buffer-box
capital-one
google
hulu
twitter
|
|
| Brace Expansion |
Medium
|
|
|
| Check if postordered array forms a binary search tree |
Medium
|
|
|
| Construct Binary Search Tree BST from Preorder Traversal |
Medium
|
amazon
facebook
microsoft
oracle
|
|
| Count Good Nodes in Binary Tree |
Medium
|
microsoft
|
|
| Find Bottom Left Tree Value |
Medium
|
bloomberg
microsoft
|
|
| Find Eventual Safe States |
Medium
|
google
|
|
| Find Leaves of Binary Tree |
Medium
|
amazon
atlassian
ebay
google
linkedin
pocket-gems
|
|
| Flatten binary tree to linked list in order of inorder traversal |
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 with Same Letters after Replacement |
Medium
|
bloomberg
google
pocket-gems
|
|
| Maximum Binary Tree |
Medium
|
amazon
facebook
google
microsoft
|
|
| 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
|
|
|
| Operations on Tree |
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
|
|
| Pseudo-Palindromic Paths in a Binary Tree |
Medium
|
amazon
|
|
| Replace each node in BST with subtree sum and its value |
Medium
|
|
|
| Right side view of a tree |
Medium
|
|
|
| Rotting Oranges |
Medium
|
|
|
| Shortest path in Binary Search Tree that adds up to a given value |
Medium
|
|
|
| Sum of Two Integers |
Medium
|
amazon
apple
facebook
google
hulu
|
|
| Task Scheduler |
Medium
|
amazon
apple
bloomberg
facebook
google
microsoft
nutanix
oracle
pinterest
uber
vmware
|
|
| Top K Frequent Elements |
Medium
|
amazon
apple
bloomberg
bytedance
ebay
facebook
goldman-sachs
google
hulu
linkedin
microsoft
oracle
pocket-gems
snapchat
spotify
uber
vmware
yahoo
yelp
|
|
| Verify Preorder Serialization of a Binary Tree |
Medium
|
google
|
|
| Adding Spaces to a String |
Medium
|
|
|
| Alice and Bob Playing Flower Game |
Medium
|
|
|
| Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree |
Medium
|
amazon
|
|
| Closest Leaf in a Binary Tree |
Medium
|
amazon
databricks
facebook
google
|
|
| Construct Smallest Number From DI String |
Medium
|
|
|
| Count Good Numbers |
Medium
|
|
|
| Count of Substrings Containing Every Vowel and K Consonants 1 |
Medium
|
|
|
| Count Subarrays Where Max Element Appears at Least K Times |
Medium
|
|
|
| Debounce |
Medium
|
facebook
|
|
| House Robber 4 |
Medium
|
|
|
| Minimum Index of a Valid Split |
Medium
|
|
|
| Construct the Lexicographically Largest Valid Sequence |
Medium
|
|
|
| Contiguous Array |
Medium
|
adobe
amazon
apple
facebook
google
microsoft
quora
robinhood
vmware
|
|
| Count of Substrings Containing Every Vowel and K Consonants 2 |
Medium
|
|
|
| Course Schedule 4 |
Medium
|
uber
|
|
| Describe the Painting |
Medium
|
|
|
| Find Elements in a Contaminated Binary Tree |
Medium
|
google
|
|