| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Path in Directed Graph | 150 |
|
42:01 | |
| Water Flow | 200 |
|
73:40 | |
| Stepping Numbers | 300 |
|
60:55 | |
| Capture Regions on Board | 500 |
|
66:36 | |
| Word Search Board | 500 |
|
60:20 |
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Path with good nodes! | 150 |
|
61:27 | |
| Largest Distance between nodes of a Tree | 200 |
|
78:51 | |
| Good Graph | 200 |
|
61:15 | |
| Cycle in Directed Graph | 200 |
|
57:15 | |
| Delete Edge! | 200 |
|
68:59 | |
| Two teams? | 300 |
|
56:25 |
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Valid Path | 200 |
|
85:05 | |
| Snake Ladder Problem! | 200 |
|
67:26 | |
| Region in BinaryMatrix | 200 |
|
46:08 | |
| Path in Matrix | 200 |
|
34:11 | |
| Level Order | 300 |
|
29:55 | |
| Smallest Multiple With 0 and 1 | 300 |
|
76:31 | |
| Min Cost Path | 300 |
|
70:46 | |
| Permutation Swaps! | 300 |
|
59:42 |
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Commutable Islands | 200 |
|
78:31 | |
| Possibility of finishing all courses given pre-requisites | 200 |
|
65:13 | |
| Cycle in Undirected Graph | 200 |
|
54:05 | |
| Mother Vertex | 200 |
|
48:12 | |
| File Search | 200 |
|
27:10 | |
| Black Shapes | 300 |
|
48:56 |
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Convert Sorted List to Binary Search Tree | 300 |
|
44:57 |
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Sum Of Fibonacci Numbers | 300 |
|
53:26 | |
| Knight On Chess Board | 300 |
|
68:15 | |
| Useful Extra Edges | 400 |
|
62:57 | |
| Word Ladder I | 600 |
|
70:06 | |
| Word Ladder II | 800 |
|
70:05 |
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Clone Graph | 500 |
|
57:19 |
1 Million +
Strong Tech Community500 +
Questions to Practice100 +
Expert Interview Guides
