feat: Complete multi-blog setup with 12 collections and subdomain routing

- Added 12 blog collections: art, bfs, dfs, problems, puzzles, reviews, reflections, vibes, workflows, magic, contests, poetry
- Created content config with glob loaders for all collections
- Added sample posts for each collection
- Fixed TypeScript collection recognition by removing duplicate config
- Made BlogPosts component collection-aware for proper routing
- Created individual post pages ([...slug].astro) for each collection
- Added Netlify subdomain routing configuration
- Updated all references to use neeldhara.blog as main domain
- Fixed navigation links in all-blogs component

Ready for GitHub/Netlify deployment with subdomain support.

src/content/problems/dynamic-programming-gems.md

@@ -0,0 +1,32 @@
+---
+title: "Dynamic Programming: Hidden Gems from Recent Contests"
+description: "Elegant dynamic programming problems that showcase beautiful techniques and insights."
+pubDate: "Jan 25 2024"
+image: "https://images.unsplash.com/photo-1509228468518-180dd4864904?w=400&auto=format&fit=crop&q=60"
+authorImage: "/avatar/avatar1.png"
+authorName: "Neeldhara"
+---
+
+# Dynamic Programming: Hidden Gems from Recent Contests
+
+These problems demonstrate the art of dynamic programming beyond standard patterns.
+
+## Problem 1: The Subsequence Symphony
+
+Given a string, find the number of subsequences that form palindromes of prime length.
+
+### Solution Insight
+
+The key is to maintain DP states for both position and palindrome center simultaneously. This reduces the state space from O(n³) to O(n²).
+
+## Problem 2: Graph Coloring with Constraints
+
+Color a graph such that no two adjacent vertices share a color, and the total number of color changes along any path is minimized.
+
+### The DP Formulation
+
+DP[node][color][changes] gives us the minimum cost. The trick is recognizing that we only need to track changes modulo 2.
+
+## Practice Makes Perfect
+
+These problems teach us that DP is as much about problem modeling as it is about computation.

src/content/problems/graph-algorithms-assessment.md

@@ -0,0 +1,32 @@
+---
+title: "Graph Algorithms: Assessment Highlights"
+description: "Interesting graph problems from recent course assessments with detailed solutions."
+pubDate: "Feb 28 2024"
+image: "https://images.unsplash.com/photo-1550751827-4bd374c3f58b?w=400&auto=format&fit=crop&q=60"
+authorImage: "/avatar/avatar1.png"
+authorName: "Neeldhara"
+---
+
+# Graph Algorithms: Assessment Highlights
+
+A collection of graph problems that test deep understanding rather than memorization.
+
+## The Bridge Detection Variant
+
+Find all edges whose removal increases the number of triangles in the graph.
+
+### Solution Approach
+
+Counter-intuitively, we need to count triangles that share exactly one edge with the candidate. The algorithm runs in O(m√m) time using careful enumeration.
+
+## Shortest Path with Wildcards
+
+Given a graph where some edge weights are variables, find assignments that minimize the longest shortest path.
+
+### Key Insight
+
+This reduces to a linear programming problem with interesting structure. The dual interpretation reveals connections to network flow.
+
+## Teaching Through Problems
+
+These problems help students see beyond standard algorithms to underlying principles.