sync: include index.md in sync and optimize workflow, update notes

Author: VR-Rathod

.github/workflows/sync-logseq-content.yml

@@ -5,9 +5,9 @@ on:
     branches:
       - Admin
     paths:
-      - "pages/**"  # runs when notes in pages/ change
+      - "pages/**"
 
-  workflow_dispatch:  # allows manual trigger from GitHub Actions UI
+  workflow_dispatch:
 
 jobs:
   sync:
@@ -16,60 +16,35 @@ jobs:
       contents: write
 
     steps:
-      - name: Checkout Admin branch (Logseq source)
+      - name: Checkout Admin (Logseq source)
         uses: actions/checkout@v4
         with:
           ref: Admin
           path: logseq-source
+          fetch-depth: 1
 
-      - name: Checkout Web-live branch (Quartz site)
+      - name: Checkout Web-live (Quartz site)
         uses: actions/checkout@v4
         with:
           ref: Web-live
           path: quartz-site
           token: ${{ secrets.GITHUB_TOKEN }}
+          fetch-depth: 1
 
-      - name: Sync pages/ → content/
-        id: sync
+      - name: Sync and Deploy
         run: |
-          SOURCE="logseq-source/pages"
-          DEST="quartz-site/content"
+          # Sync pages/ to content/ (including index.md)
+          rsync -av --delete logseq-source/pages/ quartz-site/content/
 
-          # Use rsync to sync files, deleting removed files, but excluding index.md
-          rsync -av --delete --exclude="index.md" "$SOURCE"/ "$DEST"/
-
-      - name: Check for changes in content/
-        id: changes
-        run: |
-          cd quartz-site
-          git add content/
-          if git diff --staged --quiet; then
-            echo "has_changes=false" >> $GITHUB_OUTPUT
-            echo "No changes detected — skipping deploy."
-          else
-            changed=$(git diff --staged --name-only | wc -l)
-            echo "has_changes=true" >> $GITHUB_OUTPUT
-            echo "changed_count=$changed" >> $GITHUB_OUTPUT
-          fi
-
-      - name: Commit and push changes to Web-live
-        if: steps.changes.outputs.has_changes == 'true'
-        run: |
           cd quartz-site
           git config user.name "github-actions[bot]"
           git config user.email "github-actions[bot]@users.noreply.github.com"
-          COMMIT_SHA=$(cd ../logseq-source && git rev-parse --short HEAD)
-
-          git commit -m "sync: ${{ steps.changes.outputs.changed_count }} file(s) updated from Logseq (Admin@$COMMIT_SHA)"
-          git push origin Web-live
+          git add content/
 
-      - name: Summary
-        run: |
-          if [ "${{ steps.changes.outputs.has_changes }}" == "true" ]; then
-            echo "### ✅ Sync complete" >> $GITHUB_STEP_SUMMARY
-            echo "- **Changed files:** ${{ steps.changes.outputs.changed_count }}" >> $GITHUB_STEP_SUMMARY
-            echo "- Content pushed to **Web-live**. Hosting provider will trigger build." >> $GITHUB_STEP_SUMMARY
+          if ! git diff --staged --quiet; then
+            COMMIT_SHA=$(cd ../logseq-source && git rev-parse --short HEAD)
+            git commit -m "sync: updated from Logseq (Admin@$COMMIT_SHA)"
+            git push origin Web-live
           else
-            echo "### ⏭️ No changes" >> $GITHUB_STEP_SUMMARY
-            echo "Content was already up to date — no commit made." >> $GITHUB_STEP_SUMMARY
+            echo "No changes detected — skipping deploy."
           fi

CONTRIBUTING.md

@@ -34,12 +34,13 @@ Every page **must** start with SEO frontmatter:
 
 seoTitle: <Page Name> Complete Guide – <Short Description>
 description: "Comprehensive <topic> reference covering <key topics>."
-keywords: "<keyword1>, <keyword2>, ..., VR-Rathod, Code-Note, code note vr, vr book , <You'r name / your code tags>"
+keywords: "<keyword1>, <keyword2>, ..., VR-Rathod, Code-Note,Vaibhav Rathod, vaibhav, Vaibhav, VR, code note vr, vr book , <You'r name / your code tags>"
 displayTitle: Better Title  # This is title of page (not required for  all page)
 `seoTitle` — Keep under 60 characters. Format: `Topic Name – Subtitle`
 `description` — 1-2 sentences, 120-160 characters. Mention key subtopics.
 `keywords` — Comma-separated. Always end with the standard author tags.
 comments: false/true (For Enabling or disable comments)
+treeTitle: main page - sub page - sub page
 ```
 
 ### For Single Writer

pages/A Search Algorithm.md

@@ -3,6 +3,7 @@ seoTitle: A* Search Algorithm – Heuristic Pathfinding Algorithm Guide
 description: "Comprehensive guide to the A* Search algorithm. Explains the f(n) = g(n) + h(n) evaluation, admissibility, consistency, distance metrics, and complete grid-based pathfinding in Python, C++, JavaScript, Java, and C."
 keywords: "A* search algorithm, A* pathfinding, heuristic search, shortest path, grid pathfinding, Dijkstra vs A*, Manhattan distance, Euclidean distance, time complexity, space complexity, VR-Rathod, Code-Note, Vaibhav Rathod , A Search Algorithm"
 displayTitle: A* Search Algorithm
+treeTitle: DSA - Sorting & Searching - A Search Algorithm
 ---
 
 > [!info] What is A* Search?

pages/AA Tree.md

@@ -2,22 +2,23 @@
 seoTitle: AA Tree Explained – Self-Balancing BST with C++ and Python
 description: "Learn AA Trees, a simplified Red-Black Tree variant using levels instead of colors. Detailed skew, split, insert, delete operations in C++ and Python."
 keywords: "AA tree, balanced BST, self-balancing tree, skew, split, C++, Python, data structures, algorithms, binary search tree, tree rotation, VR-Rathod, Code-Note, code note vr, vr book"
+treeTitle: DSA - Trees - AA Tree
 ---
 
 > [!info] What is an AA Tree?
 > An **AA Tree** (Arne Andersson Tree) is a self-balancing binary search tree that simplifies the classic Red-Black Tree.
 > It enforces balance using node **levels** (integers) rather than colors, significantly reducing the number of rotation cases needed during insertions and deletions.
 
 - # Explanation
-	- An **AA Tree** is a variant of the Red-Black Tree that eliminates half of the restructuring cases by requiring that **only right children** can be at the same level as their parent. 
+	- An **AA Tree** is a variant of the Red-Black Tree that eliminates half of the restructuring cases by requiring that **only right children** can be at the same level as their parent.
 	- Instead of colors (Red/Black), every node is tagged with an integer **level** representing the black height of the node.
 	-
 	- ## Real-World Analogy
 	  collapsed:: true
 		- Think of a **corporate hierarchy** where employees are assigned strict grade levels.
-		  - You can have a peer (at your same grade level) working directly under you, but to avoid structural confusion, they **must sit on your right**. 
-		  - No peers are allowed to sit on your left (left-child same level).
-		  - You can have at most one peer reporting to you; if a second peer joins them, it triggers a promotion (level increment) to rebalance the team.
+			- You can have a peer (at your same grade level) working directly under you, but to avoid structural confusion, they **must sit on your right**.
+			- No peers are allowed to sit on your left (left-child same level).
+			- You can have at most one peer reporting to you; if a second peer joins them, it triggers a promotion (level increment) to rebalance the team.
 	-
 	- ## Why AA Tree Over Red-Black Tree?
 	  collapsed:: true

pages/Abstract Classes.md

@@ -3,6 +3,7 @@ seoTitle: Abstract Classes in OOP – Complete In-Depth Guide | Abstract Methods
 description: "Deep dive into Abstract Classes in OOP. Covers what abstract classes are, abstract vs concrete methods, abstract class vs interface, the template method pattern, and examples in Python, C++, Java, JavaScript, and C#."
 keywords: "abstract class, OOP, abstract method, ABC, template method, Python abstract class, Java abstract class, C++ pure virtual, interface vs abstract class, VR-Rathod, Code-Note"
 displayTitle: Abstract Classes
+treeTitle: DSA - OOP - Abstract Classes
 ---
 
 > [!info] What is an Abstract Class?
@@ -49,7 +50,6 @@ displayTitle: Abstract Classes
 		      def analyze(self, data: list) -> dict:  # concrete default
 		          return {"count": len(data)}
 		  ```
-
 - # Implementation
   collapsed:: true
 	- > [!note] A `Shape` abstract class hierarchy + a `DataExporter` template method pattern.
@@ -350,15 +350,13 @@ displayTitle: Abstract Classes
 	  ```
 	  
 	  :::
-
 - # Key Takeaways
   collapsed:: true
 	- **Abstract class** = template for subclasses — defines what must be done, may show how common parts work.
 	- **Cannot be instantiated** — attempting to do so throws a `TypeError` (Python), compile error (Java/C#/C++).
 	- Mix of **abstract methods** (must override) and **concrete methods** (optional to override).
 	- Prefer **abstract class** when: related classes share code + state. Prefer **interface** when: unrelated classes share capability.
 	- Enables **Template Method Pattern** — define algorithm skeleton in base, defer variable steps to subclasses.
-
 - # More Learn
   collapsed:: true
 	- ## GitHub & Webs

pages/Abstraction.md

@@ -3,6 +3,7 @@ seoTitle: Abstraction in OOP – Complete In-Depth Guide | Data Hiding, Abstract
 description: "Deep dive into Abstraction in OOP. Covers data abstraction, procedural abstraction, abstract classes, interfaces, and when to apply abstraction with examples in Python, C++, Java, JavaScript, and C#."
 keywords: "abstraction, OOP, abstract class, interface, data hiding, Python abstraction, Java abstraction, C++ abstract class, JavaScript abstraction, CSharp abstraction, design principles, VR-Rathod, Code-Note"
 displayTitle: Abstraction
+treeTitle: DSA - OOP - Abstraction
 ---
 
 - # Introduction

pages/Ackermann Function.md

@@ -2,6 +2,7 @@
 seoTitle: Ackermann Function – Computability, Up-Arrows & Inverse Ackermann Guide
 description: "An exhaustive master-level guide to the Ackermann Function. Covers Computability Theory, Primitive Recursive vs General Recursive functions, Knuth's Up-Arrow notation, recursive trace trees, and the Inverse Ackermann complexity bounds in Disjoint Set Union."
 keywords: "Ackermann function, recursion, primitive recursive, computability theory, Knuth up-arrow, inverse Ackermann, Union-Find complexity, tetration, stack overflow, DSA"
+treeTitle: DSA - Math & Geometry - Ackermann Function
 ---
 
 > [!info] What is the Ackermann Function?
@@ -121,7 +122,7 @@ keywords: "Ackermann function, recursion, primitive recursive, computability the
 	  > Languages: [[Python]] · [[Cpp]] · [[Java Script]] · [[Java]]
 	-
 	- :::code-tabs
-
+	  
 	  ```python
 	  # 1. Basic Recursive
 	  def ackermann_recursive(m: int, n: int) -> int:
@@ -130,7 +131,7 @@ keywords: "Ackermann function, recursion, primitive recursive, computability the
 	      if n == 0:
 	          return ackermann_recursive(m - 1, 1)
 	      return ackermann_recursive(m - 1, ackermann_recursive(m, n - 1))
-
+	  
 	  # 2. Memoized (to handle slightly larger values)
 	  memo = {}
 	  def ackermann_memo(m: int, n: int) -> int:
@@ -145,7 +146,7 @@ keywords: "Ackermann function, recursion, primitive recursive, computability the
 	          res = ackermann_memo(m - 1, ackermann_memo(m, n - 1))
 	      memo[key] = res
 	      return res
-
+	  
 	  # 3. Iterative with Explicit Stack (prevents stack overflow)
 	  def ackermann_iterative(m: int, n: int) -> int:
 	      stack = [m]
@@ -161,25 +162,25 @@ keywords: "Ackermann function, recursion, primitive recursive, computability the
 	              stack.append(m_val)
 	              n = n - 1
 	      return n
-
+	  
 	  # Example usage
 	  print("A(2, 1) =", ackermann_recursive(2, 1))  # 5
 	  print("A(3, 4) =", ackermann_memo(3, 4))        # 125
 	  print("A(3, 7) =", ackermann_iterative(3, 7))   # 4093
 	  ```
-
+	  
 	  ```c++
 	  #include <iostream>
 	  #include <map>
 	  #include <stack>
-
+	  
 	  // 1. Basic Recursive
 	  long long ackermann_recursive(long long m, long long n) {
 	      if (m == 0) return n + 1;
 	      if (n == 0) return ackermann_recursive(m - 1, 1);
 	      return ackermann_recursive(m - 1, ackermann_recursive(m, n - 1));
 	  }
-
+	  
 	  // 2. Memoized
 	  std::map<std::pair<long long, long long>, long long> memo;
 	  long long ackermann_memo(long long m, long long n) {
@@ -197,7 +198,7 @@ keywords: "Ackermann function, recursion, primitive recursive, computability the
 	      memo[key] = res;
 	      return res;
 	  }
-
+	  
 	  // 3. Iterative with Explicit Stack
 	  long long ackermann_iterative(long long m, long long n) {
 	      std::stack<long long> stk;
@@ -217,23 +218,23 @@ keywords: "Ackermann function, recursion, primitive recursive, computability the
 	      }
 	      return n;
 	  }
-
+	  
 	  int main() {
 	      std::cout << "A(2, 1) = " << ackermann_recursive(2, 1) << "\n"; // 5
 	      std::cout << "A(3, 4) = " << ackermann_memo(3, 4) << "\n";       // 125
 	      std::cout << "A(3, 7) = " << ackermann_iterative(3, 7) << "\n";  // 4093
 	      return 0;
 	  }
 	  ```
-
+	  
 	  ```javascript
 	  // 1. Basic Recursive
 	  function ackermannRecursive(m, n) {
 	      if (m === 0) return n + 1;
 	      if (n === 0) return ackermannRecursive(m - 1, 1);
 	      return ackermannRecursive(m - 1, ackermannRecursive(m, n - 1));
 	  }
-
+	  
 	  // 2. Memoized
 	  const memo = new Map();
 	  function ackermannMemo(m, n) {
@@ -250,7 +251,7 @@ keywords: "Ackermann function, recursion, primitive recursive, computability the
 	      memo.set(key, res);
 	      return res;
 	  }
-
+	  
 	  // 3. Iterative with Explicit Stack
 	  function ackermannIterative(m, n) {
 	      const stack = [m];
@@ -269,15 +270,15 @@ keywords: "Ackermann function, recursion, primitive recursive, computability the
 	      }
 	      return n;
 	  }
-
+	  
 	  console.log("A(2, 1) =", ackermannRecursive(2, 1));
 	  console.log("A(3, 4) =", ackermannMemo(3, 4));
 	  console.log("A(3, 7) =", ackermannIterative(3, 7));
 	  ```
-
+	  
 	  ```java
 	  import java.util.*;
-
+	  
 	  public class Ackermann {
 	      
 	      // 1. Basic Recursive
@@ -286,7 +287,7 @@ keywords: "Ackermann function, recursion, primitive recursive, computability the
 	          if (n == 0) return ackermannRecursive(m - 1, 1);
 	          return ackermannRecursive(m - 1, ackermannRecursive(m, n - 1));
 	      }
-
+	  
 	      // 2. Memoized
 	      private static Map<String, Long> memo = new HashMap<>();
 	      public static long ackermannMemo(long m, long n) {
@@ -303,7 +304,7 @@ keywords: "Ackermann function, recursion, primitive recursive, computability the
 	          memo.put(key, res);
 	          return res;
 	      }
-
+	  
 	      // 3. Iterative with Explicit Stack
 	      public static long ackermannIterative(long m, long n) {
 	          Stack<Long> stack = new Stack<>();
@@ -323,15 +324,15 @@ keywords: "Ackermann function, recursion, primitive recursive, computability the
 	          }
 	          return n;
 	      }
-
+	  
 	      public static void main(String[] args) {
 	          System.out.println("A(2, 1) = " + ackermannRecursive(2, 1));
 	          System.out.println("A(3, 4) = " + ackermannMemo(3, 4));
 	          System.out.println("A(3, 7) = " + ackermannIterative(3, 7));
 	      }
 	  }
 	  ```
-
+	  
 	  :::
 	-
 - # Key Takeaways

pages/Activity Selection Problem.md

@@ -3,6 +3,7 @@ seoTitle: Activity Selection Problem – Greedy Interval Scheduling Algorithm Gu
 description: "Master the Activity Selection Problem using greedy interval scheduling. Covers earliest finish time strategy, exchange argument proof, weighted variant with DP, and full implementations in Python, C++, JavaScript, and Java."
 keywords: "activity selection problem, interval scheduling, greedy algorithm, earliest finish time, non-overlapping intervals, weighted job scheduling, DP, Python, C++, Java, JavaScript, DSA"
 displayTitle: Activity Selection Problem
+treeTitle: DSA - DP & Greedy - Activity Selection Problem
 ---
 
 > [!info] What is the Activity Selection Problem?

pages/Aggregation.md

@@ -3,6 +3,7 @@ seoTitle: Aggregation in OOP – Complete In-Depth Guide | HAS-A Weak Ownership,
 description: "Deep dive into Aggregation in OOP. Covers weak HAS-A relationships, independent child lifecycle, differences from Composition and Association, UML notation, and examples in Python, C++, Java, JavaScript, and C#."
 keywords: "aggregation, OOP, has-a relationship, weak ownership, aggregation vs composition, independent lifecycle, Python aggregation, Java aggregation, C++ aggregation, UML diamond, VR-Rathod, Code-Note"
 displayTitle: Aggregation
+treeTitle: DSA - OOP - Aggregation
 ---
 
 > [!info] What is Aggregation?
@@ -30,7 +31,6 @@ displayTitle: Aggregation
 		  | Child lifecycle | Independent | **Independent** | Tied to parent |
 		  | UML | Simple line | ◇ empty diamond | ◆ filled diamond |
 		  | Example | Doctor–Patient | Team–Player | Car–Engine |
-
 - # Implementation
   collapsed:: true
 	- > [!note] A `Library` with `Books` and a `University` with `Departments` — books and departments can exist independently of their containers.
@@ -300,17 +300,15 @@ displayTitle: Aggregation
 	  ```
 	  
 	  :::
-
 - # Key Takeaways
   collapsed:: true
 	- **Aggregation = HAS-A with weak ownership** — child objects survive parent destruction.
 	- Represented with **raw pointers** (C++) or **references** (Java/Python/C#/JS) — not embedded instances.
 	- A child can be shared between multiple parents (same Book in two Libraries).
 	- Weaker than [[Composition]] (strong ownership), stronger than pure [[Association]] (no ownership).
 	- Use aggregation when the child has meaning/utility **outside the containing object**.
-
 - # More Learn
   collapsed:: true
 	- ## GitHub & Webs
 		- [GeeksforGeeks — Aggregation vs Composition](https://www.geeksforgeeks.org/association-composition-aggregation-in-java/)
-		- [UML Aggregation — IBM](https://developer.ibm.com/articles/the-class-diagram/)
+		- [UML Aggregation — IBM](https://developer.ibm.com/articles/the-class-diagram/)

pages/Aho Corasick Algorithm.md

@@ -2,6 +2,7 @@
 seoTitle: Aho Corasick Algorithm – Efficient Multi-Pattern String Matching
 description: "Comprehensive guide to the Aho Corasick Algorithm. Explains trie-based multi-pattern matching, failure links, dictionary links, and full implementations in 5 languages."
 keywords: "Aho-Corasick, multi-pattern search, trie, failure link, dictionary link, string matching, algorithm, C++, Python, Java, JavaScript, C, VR-Rathod, Code-Note, Vaibhav Rathod"
+treeTitle: DSA - String Algorithms - Aho Corasick Algorithm
 ---
 
 > [!info] What is the Aho Corasick Algorithm?