Problem | Score | Companies | Time | Status |
---|---|---|---|---|
Path in Directed Graph | 150 |
|
40:20 | |
Water Flow | 200 |
|
69:12 | |
Stepping Numbers | 300 |
|
59:52 | |
Capture Regions on Board | 500 |
|
65:57 | |
Word Search Board | 500 |
|
59:16 |
Problem | Score | Companies | Time | Status |
---|---|---|---|---|
Path with good nodes! | 150 |
|
57:16 | |
Largest Distance between nodes of a Tree | 200 |
|
77:39 | |
Good Graph | 200 |
|
61:49 | |
Cycle in Directed Graph | 200 |
|
55:20 | |
Delete Edge! | 200 |
|
63:57 | |
Two teams? | 300 |
|
52:28 |
Problem | Score | Companies | Time | Status |
---|---|---|---|---|
Valid Path | 200 |
|
83:46 | |
Snake Ladder Problem! | 200 |
|
63:57 | |
Region in BinaryMatrix | 200 |
|
44:12 | |
Level Order | 300 |
|
29:55 | |
Smallest Multiple With 0 and 1 | 300 |
|
74:26 | |
Min Cost Path | 300 |
|
65:56 | |
Permutation Swaps! | 300 |
|
55:45 |
Problem | Score | Companies | Time | Status |
---|---|---|---|---|
Commutable Islands | 200 |
|
77:21 | |
Possibility of finishing all courses given pre-requisites | 200 |
|
64:33 | |
Cycle in Undirected Graph | 200 |
|
52:26 | |
Black Shapes | 300 |
|
48:52 |
Problem | Score | Companies | Time | Status |
---|---|---|---|---|
Convert Sorted List to Binary Search Tree | 300 |
|
44:30 |
Problem | Score | Companies | Time | Status |
---|---|---|---|---|
Sum Of Fibonacci Numbers | 300 |
|
52:49 | |
Knight On Chess Board | 300 |
|
67:27 | |
Useful Extra Edges | 400 |
|
62:08 | |
Word Ladder I | 600 |
|
68:57 | |
Word Ladder II | 800 |
|
67:23 |
Problem | Score | Companies | Time | Status |
---|---|---|---|---|
Clone Graph | 500 |
|
56:55 |
Problem | Score | Companies | Time | Status |
---|---|---|---|---|
Connected Components | 200 |
|
19:55 | |
File Search | 200 |
|
20:42 | |
Mother Vertex | 200 |
|
50:15 | |
Path in Matrix | 200 |
|
26:20 |