| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Valid BST from Preorder | 100 |
|
62:49 | |
| Kth Smallest Element In Tree | 300 |
|
29:17 | |
| 2-Sum Binary Tree | 400 |
|
63:53 | |
| BST Iterator | 500 |
|
41:35 | |
| Recover Binary Search Tree | 750 |
|
66:09 |
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Xor Between Two Arrays! | 150 |
|
53:33 | |
| Hotel Reviews | 200 |
|
75:41 | |
| Shortest Unique Prefix | 350 |
|
69:53 |
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Path to Given Node | 200 |
|
42:27 | |
| Remove Half Nodes | 200 |
|
47:27 | |
| Nodes at Distance K | 200 |
|
57:32 | |
| Last Node in a Complete Binary Tree | 200 |
|
34:05 | |
| Consecutive Parent - Child | 200 |
|
20:27 | |
| Balanced Binary Tree | 275 |
|
30:19 | |
| Maximum Edge Removal | 300 |
|
56:41 |
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Merge two Binary Tree | 200 |
|
32:21 | |
| Symmetric Binary Tree | 300 |
|
22:00 | |
| Identical Binary Trees | 300 |
|
11:36 |
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Construct BST from Preorder | 200 |
|
40:52 | |
| Inorder Traversal of Cartesian Tree | 300 |
|
51:21 | |
| Sorted Array To Balanced BST | 300 |
|
28:46 | |
| Construct Binary Tree From Inorder And Preorder | 375 |
|
47:03 | |
| Binary Tree From Inorder And Postorder | 375 |
|
50:43 |
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Vertical Order traversal of Binary Tree | 200 |
|
74:25 | |
| Diagonal Traversal | 200 |
|
49:12 | |
| Vertical Sum of a Binary Tree | 200 |
|
29:15 | |
| Covered / Uncovered Nodes | 200 |
|
39:50 | |
| Inorder Traversal | 350 |
|
32:00 | |
| Preorder Traversal | 350 |
|
15:26 | |
| Postorder Traversal | 350 |
|
31:28 |
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Right view of Binary tree | 200 |
|
31:24 | |
| Cousins in Binary Tree | 200 |
|
60:00 | |
| Reverse Level Order | 249 |
|
26:21 | |
| ZigZag Level Order Traversal BT | 350 |
|
42:13 | |
| Populate Next Right Pointers Tree | 900 |
|
50:58 |
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Burn a Tree | 200 |
|
64:05 | |
| Max Depth of Binary Tree | 350 |
|
6:57 | |
| Sum Root to Leaf Numbers | 350 |
|
45:33 | |
| Path Sum | 350 |
|
27:35 | |
| Min Depth of Binary Tree | 350 |
|
17:20 | |
| Root to Leaf Paths With Sum | 350 |
|
41:13 |
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Invert the Binary Tree | 300 |
|
12:46 |
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Least Common Ancestor | 450 |
|
57:33 |
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Flatten Binary Tree to Linked List | 500 |
|
43:45 |
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Order of People Heights | 700 |
|
76:44 |