| Continuous Subarrays |
Medium
|
|
|
| Find Score of an Array After Marking All Elements |
Medium
|
|
|
| Take Gifts From the Richest Pile |
Easy
|
|
|
| Maximum Beauty of an Array After Applying Operation |
Medium
|
|
|
| Find Longest Special Substring That Occurs Thrice 2 |
Medium
|
|
|
| Find Longest Special Substring That Occurs Thrice 1 |
Medium
|
|
|
| Special Array 2 |
Medium
|
|
|
| Minimum Limit of Balls in a Bag |
Medium
|
|
|
| Maximum Number of Integers to Choose From a Range 1 |
Medium
|
|
|
| Move Pieces to Obtain a String Problem |
Medium
|
|
|
| Alien Dictionary |
Hard
|
airbnb
amazon
apple
bloomberg
cohesity
doordash
facebook
flipkart
google
microsoft
pinterest
pocket-gems
snapchat
square
twitter
uber
vmware
|
|
| Amount of New Area Painted Each Day |
Hard
|
|
|
| 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
|
|
|
| Circular Linked List Complete Implementation |
|
|
|
| Construct Binary Search Tree BST from Preorder Traversal |
Medium
|
amazon
facebook
microsoft
oracle
|
|
| Construct special triangle using sum in reverse from given array |
|
|
|
| Convert a sorted doubly linked list DLL to balanced binary search tree |
|
|
|
| Convert a sorted doubly linked list DLL to balanced binary search tree in-place |
|
|
|
| Convert Binary Tree into Threaded Binary Tree |
|
|
|
| Count Good Nodes in Binary Tree |
Medium
|
microsoft
|
|
| Duplicate each node in a binary search tree and add as its left child |
Easy
|
|
|
| Evaluate an expression tree and generate a parenthesised form |
|
|
|
| Find a Corresponding Node of a Binary Tree in a Clone of That Tree |
Easy
|
facebook
|
|
| Find Bottom Left Tree Value |
Medium
|
bloomberg
microsoft
|
|
| Find Eventual Safe States |
Medium
|
google
|
|
| Find GCD of n numbers |
Easy
|
amazon
|
|
| Find Leaves of Binary Tree |
Medium
|
amazon
atlassian
ebay
google
linkedin
pocket-gems
|
|
| Find nodes in binary tree without siblings |
|
|
|
| Find Size of Binary Tree |
|
|
|
| Find the depth of a node in a binary tree |
|
|
|
| Find the height of a node in a binary tree |
|
|
|
| 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 |
|
|
|
| Implement queue using linked list |
|
|
|
| Implementing a queue using a fixed-size array |
|
|
|
| Interval Scheduling Problem |
|
|
|
| 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
|
|
| Maximum in a Binary Search Tree |
Easy
|
|
|
| Maximum in a Binary Tree |
Easy
|
|
|
| Min Queue Problem |
Easy
|
|
|
| Minimum in a Binary Search Tree |
Easy
|
|
|
| Nodes at Distance k from Leaf Nodes in Binary Tree |
|
|
|