vault backup: 2022-07-07 21:24:34

.obsidian/starred.json

@@ -8,7 +8,7 @@
     {
       "type": "file",
       "title": "CS-index",
-      "path": "CS notes/CS-index.md"
+      "path": "OJ notes/OJ-index.md"
     },
     {
       "type": "file",

CTF notes/CTF-index.md

@@ -0,0 +1 @@
+# CTF-index

Index.md

@@ -13,7 +13,8 @@ ___
 ## Table of contents
 
 ### Computer science notes
-- [[CS-index]]
+- [[OJ-index]]
+- [[CTF-index]]
 
 ### Misc
 - [[Wiki-Index]]

OJ notes/pages/Leetcode Maxinum-subarray.md

@@ -83,7 +83,7 @@ public:
 
 ### Thoughts
 
-This is a [[Kadane's algorithm]] problem, and the philosophy behind it id divide and conquer. 
+This is a [[Kadane's Algorithm]] problem, and the philosophy behind it id divide and conquer. 
 local_max is the max accumulated number we've found, and global_max is the max local_max we've found.
 ```cpp
 local_max = max(nums[i] + local_max, nums[i])

Wiki/Notes for CS.md

@@ -5,4 +5,4 @@
 5. ```matrix[i][j]``` in scanning a 2d array.
 6. figure out ```matrix[i][j]``` and ```matrix[i][n-1]```
 
-More can be found in [[CS-index]]
+More can be found in [[OJ-index]]