Problem | Score | Companies | Time | Status |
---|---|---|---|---|
Valid BST from Preorder | 100 |
|
62:31 | |
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:03 |
Problem | Score | Companies | Time | Status |
---|---|---|---|---|
Xor Between Two Arrays! | 150 |
|
52:38 | |
Hotel Reviews | 200 |
|
75:36 | |
Shortest Unique Prefix | 350 |
|
69:45 |
Problem | Score | Companies | Time | Status |
---|---|---|---|---|
Path to Given Node | 200 |
|
42:27 | |
Remove Half Nodes | 200 |
|
47:20 | |
Nodes at Distance K | 200 |
|
56:11 | |
Last Node in a Complete Binary Tree | 200 |
|
33:06 | |
Consecutive Parent - Child | 200 |
|
20:02 | |
Balanced Binary Tree | 275 |
|
30:19 | |
Maximum Edge Removal | 300 |
|
56:11 |
Problem | Score | Companies | Time | Status |
---|---|---|---|---|
Merge two Binary Tree | 200 |
|
32:13 | |
Symmetric Binary Tree | 300 |
|
22:00 | |
Identical Binary Trees | 300 |
|
11:36 |
Problem | Score | Companies | Time | Status |
---|---|---|---|---|
Construct BST from Preorder | 200 |
|
39:17 | |
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:04 | |
Vertical Sum of a Binary Tree | 200 |
|
28:36 | |
Covered / Uncovered Nodes | 200 |
|
38:48 | |
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 |
|
59:49 | |
Reverse Level Order | 249 |
|
26:16 | |
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 |
|
63:29 | |
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:35 |