| Final Prices With a Special Discount in a Shop |
Easy
|
|
|
| Construct String With Repeat Limit |
Medium
|
|
|
| Final Array State After K Multiplication Operations I |
Easy
|
|
|
| Maximum Average Pass Ratio |
Medium
|
|
|
| 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 II |
Medium
|
|
|
| Minimum Limit of Balls in a Bag |
Medium
|
|
|
| Maximum Number of Integers to Choose From a Range I |
Medium
|
|
|
| Move Pieces to Obtain a String |
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 Tree Pruning |
Medium
|
amazon
buffer-box
capital-one
google
hulu
twitter
|
|
| Brace Expansion |
Medium
|
|
|
| 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
|
|
|