diff options
| author | Aditya Naik | 2019-03-02 04:38:17 -0500 |
|---|---|---|
| committer | Aditya Naik | 2019-03-02 04:38:17 -0500 |
| commit | e5ecb183fa1df79ae76086d81780c66cdd9d69b7 (patch) | |
| tree | 314fb1d71a9d95c98022bdfb526d97022ec75281 /log.org | |
| parent | 098415483c31f06faa04200c08a7112c28c6c0ec (diff) | |
Starting 924
Diffstat (limited to 'log.org')
| -rw-r--r-- | log.org | 5 |
1 files changed, 4 insertions, 1 deletions
@@ -3,7 +3,7 @@ * DONE 146 - Supposed to be solved with cpp stl, perhaps a c implementation of next_permutation will be more exciting? -* WORKING 429 +* DONE 429 - Word transformation: looks like a graph problem - Appears under 'easy BFS' - Needs to be revisited @@ -12,3 +12,6 @@ - A segment tree perhaps? - Attempting a (naive) linear array first to see if it works (half expecting it to fail on time limit) - Failed on TLE +* TODO 924 +- Involves finding the graph depth maximum number of nodes from a given node +- BFS with keeping track of queue size at each depth |