| Make String a Subsequence Using Cyclic Increments |
Medium
|
|
|
| Matrix Diagonal Sum |
Easy
|
|
|
| Max Sum of a Pair With Equal Sum of Digits |
Medium
|
|
|
| Maximum Score After Splitting a String |
Easy
|
google
|
|
| Minimum Obstacle Removal to Reach Corner |
Hard
|
|
|
| Minimum Recolors to Get K Consecutive Black Blocks |
Easy
|
|
|
| Partition Array According to Given Pivot |
Medium
|
amazon
|
|
| Special Array 1 |
Easy
|
|
|
| Valid Arrangement of Pairs |
Hard
|
|
|
| Valid Palindrome 4 - is string palindrome after at most 2 char replacement |
Medium
|
|
|
| Shortest Distance After Road Addition Queries I |
Medium
|
|
|
| Path Sum IV |
Medium
|
alibaba
|
|
| Binary Tree Path Sum - Maximum between any two leaves |
|
|
|
| Binary Tree Path Sum - Maximum Sum Leaf to Root path |
|
|
|
| Binary Tree Path Sum - Maximum Sum Root to Leaf path |
|
|
|
| Binary Tree Path Sum - Minimum Sum Root to Leaf path |
Easy
|
apple
|
|
| Binary Tree Path Sum 5 - Print all paths in a binary tree which sum up to a value |
Medium
|
|
|
| Check If One Binary is Mirror Tree of another Binary Tree |
|
|
|
| Check if tree is full binary tree |
|
|
|
| Closest leaf to root in a binary tree |
|
|
|
| Construct ancestor matrix from a binary tree |
|
|
|
| Construct binary tree from an ancestor matrix |
|
|
|
| Convert binary tree to its Sum tree |
|
|
|
| Convert Heap ordered Linked List to Binary Tree |
|
|
|
| Delete a binary tree completely |
|
|
|
| Diameter Of a N-Ary Tree |
Medium
|
facebook
google
|
|
| Distance between two nodes in binary tree |
Medium
|
amazon
|
|
| Find distance from root to given node in binary tree |
|
|
|
| Find path from root to given node in a binary tree |
|
|
|
| Flatten Binary Search Tree to Circular Doubly Linked List |
|
|
|
| Flatten Binary tree to double linked list in-place |
|
|
|
| Implement queue using resizing array |
|
|
|
| Improve search in BST with sentinel |
Medium
|
|
|
| In a Binary Tree, Check if Two nodes has the same parent or are siblings |
|
|
|
| Inorder predecessor and successor of a node in binary search tree |
|
|
|
| Is Graph Bipartite |
Medium
|
amazon
dropbox
ebay
facebook
google
linkedin
liveramp
microsoft
uber
|
|
| Minimum Number Of Platforms For Train Station |
|
|
|
| Optimal binary search tree construction for minimum search cost |
|
|
|
| Rectangle Overlap |
Easy
|
adobe
amazon
apple
bloomberg
goldman-sachs
google
mathworks
microsoft
oracle
|
|
| Robot Room Cleaner |
Hard
|
amazon
facebook
google
microsoft
|
|
| Shortest Unique Prefix |
Medium
|
google
square
|
|
| Target Sum |
Medium
|
facebook
google
microsoft
|
|
| Transformations Between Binary Tree Structuctures and Linked Lists |
|
|
|
| Binary Tree Path - All root to leaf paths |
Easy
|
adobe
amazon
apple
facebook
google
microsoft
|
|
| Closest Binary Search Tree Value |
Easy
|
amazon
bloomberg
facebook
google
linkedin
microsoft
snapchat
|
|
| Closest Binary Search Tree Value II |
Hard
|
amazon
facebook
forusall
google
linkedin
|
|
| Count distinct binary trees for a given number of nodes |
|
|
|
| Maximum CPU Load For Running Tasks |
|
|
|
| Validate Binary Tree Nodes |
Medium
|
facebook
|
|
| Find Champion II |
Medium
|
|
|