1 files changed, 3 insertions, 3 deletions
diff --git a/log.org b/log.org
index f772b32..ed8bff7 100644
--- a/log.org
+++ b/log.org
@@ -7,11 +7,11 @@
 - Word transformation: looks like a graph problem
   - Appears under 'easy BFS' 
 - Needs to be revisited
+* DONE 924
+- Involves finding the depth with maximum number of nodes from a given node
+- BFS with keeping track of queue sizes for each depth
 * UNFINISHED 12532
 - On uhunt this problem is put under 'tree-related structures', but not sure how a tree might be useful in this case
   - 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 depth with maximum number of nodes from a given node
-- BFS with keeping track of queue sizes for each depth