diff options
| author | Aditya Naik | 2019-02-23 19:01:37 -0500 |
|---|---|---|
| committer | Aditya Naik | 2019-02-23 19:01:37 -0500 |
| commit | 032ffe90491fd692cead2c17db6ac0a1f6479d95 (patch) | |
| tree | e7746782ba91ce4658c834d27bd25f517635f564 | |
| parent | 3e4890c5a4e4e1806cfd001150116e52b52b70e4 (diff) | |
146 AC
| -rw-r--r-- | log.org | 13 |
1 files changed, 9 insertions, 4 deletions
@@ -1,6 +1,11 @@ #+STARTUP: indent content -#+TODO: TODO WORKING VERIFY | DONE - -* TODO 146 -- +#+TODO: TODO UNFINISHED WORKING | DONE +* DONE 146 +- Supposed to be solved with cpp stl, perhaps a c implementation of next_permutation will be more exciting? +* UNFINISHED 429 +- Word transformation: looks like a graph problem +- Needs to be revisited +* WORKING 12532 +- On uhunt this problem is put under a 'tree-related structures', but not sure how a tree might be useful in this case + - Attempting a (naive) linear array first to see if it works (half expecting it to fail on time limit) |
