From 032ffe90491fd692cead2c17db6ac0a1f6479d95 Mon Sep 17 00:00:00 2001
From: Aditya Naik
Date: Sat, 23 Feb 2019 19:01:37 -0500
Subject: 146 AC

---
 log.org | 13 +++++++++----
 1 file changed, 9 insertions(+), 4 deletions(-)

diff --git a/log.org b/log.org
index b455632..fd24b6a 100644
--- a/log.org
+++ b/log.org
@@ -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)
-- 
cgit v1.2.3