| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Path in Directed Graph | 150 |
|
42:41 | |
| Water Flow | 200 |
|
75:59 | |
| Stepping Numbers | 300 |
|
61:32 | |
| Capture Regions on Board | 500 |
|
66:55 | |
| Word Search Board | 500 |
|
60:50 |
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Path with good nodes! | 150 |
|
63:12 | |
| Largest Distance between nodes of a Tree | 200 |
|
79:28 | |
| Good Graph | 200 |
|
62:25 | |
| Cycle in Directed Graph | 200 |
|
58:04 | |
| Delete Edge! | 200 |
|
71:54 | |
| Two teams? | 300 |
|
58:37 |
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Valid Path | 200 |
|
85:44 | |
| Region in BinaryMatrix | 200 |
|
47:02 | |
| Path in Matrix | 200 |
|
36:56 | |
| Level Order | 300 |
|
29:55 | |
| Smallest Multiple With 0 and 1 | 300 |
|
78:16 | |
| Snake Ladder Problem! | 300 |
|
69:09 | |
| Min Cost Path | 300 |
|
73:12 | |
| Permutation Swaps! | 300 |
|
63:03 |
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Commutable Islands | 200 |
|
79:04 | |
| Possibility of finishing all courses given pre-requisites | 200 |
|
65:35 | |
| Cycle in Undirected Graph | 200 |
|
54:49 | |
| Mother Vertex | 200 |
|
51:19 | |
| File Search | 200 |
|
30:04 | |
| Black Shapes | 300 |
|
49:07 |
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Convert Sorted List to Binary Search Tree | 300 |
|
45:05 |
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Sum Of Fibonacci Numbers | 300 |
|
53:53 | |
| Knight On Chess Board | 300 |
|
68:27 | |
| Useful Extra Edges | 400 |
|
65:50 | |
| Word Ladder I | 600 |
|
70:35 | |
| Word Ladder II | 800 |
|
71:41 |
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Clone Graph | 500 |
|
57:29 |