Merge pull request #73 from madhusudhan1234/notes

Notes

Author: madhusudhan1234

README.md

@@ -1 +1,100 @@
-# Madhu Sudhan subedi Website
+# Madhu Sudhan Subedi — Personal Website
+
+A fast, content‑driven personal site built with Astro. It includes:
+- Blog posts (MD/MDX) with RSS and sitemap
+- Notes with tag filtering (e.g., `js-data-structure`)
+- Weekly podcast episodes with per‑episode pages and audio embeds
+
+## Tech Stack
+- Astro 5
+- MD/MDX content collections
+- Vanilla CSS (global theme)
+- RSS + Sitemap integrations
+
+## Getting Started
+```bash
+npm install
+npm run dev
+# open http://localhost:4321
+```
+
+## Build
+```bash
+npm run build
+npm run preview
+```
+Static output is written to `dist/`.
+
+## Project Structure
+```
+src/
+  components/        # shared UI (Header, Footer, etc.)
+  content/
+    blog/            # blog posts (MD/MDX)
+    notes/           # notes (MD/MDX)
+    episodes/        # weekly episode metadata (MD)
+  layouts/           # page/post layouts
+  pages/
+    index.astro
+    blog/            # blog index and routes
+    notes/           # notes index and routes
+      tag/[tag].astro  # filter notes by tag
+    weekly/          # weekly index and episode pages
+styles/
+  global.css         # site theme and layout styles
+content.config.ts    # content collections and schemas
+```
+
+## Content Authoring
+
+### Blog frontmatter
+```yaml
+title: string
+description: string
+pubDate: string (coerced to Date)
+updatedDate?: string
+heroImage?: string
+```
+
+### Notes frontmatter
+```yaml
+title: string
+description: string
+pubDate: string (coerced to Date)
+updatedDate?: string
+heroImage?: string
+tags?: string        # comma-separated or single tag
+```
+
+Tag filter page is available at `/notes/tag/{tag}`.
+
+### Weekly episodes frontmatter
+```yaml
+id: number
+title: string
+description: string
+published: boolean
+audioLink: string
+publishDate: string (coerced to Date)
+duration: string
+tags: string
+```
+
+## Routes
+- `/` — Home
+- `/blog` — Blog index
+- `/blog/{slug}` — Blog post
+- `/notes` — Notes index
+- `/notes/{slug}` — Note detail
+- `/notes/tag/{tag}` — Notes filtered by tag
+- `/weekly` — Weekly index (paginated)
+- `/weekly/{id}` — Episode detail
+- `/rss.xml` — RSS feed
+
+## Scripts
+- `npm run dev` — Start local dev server
+- `npm run build` — Build static site
+- `npm run preview` — Preview built site
+
+## Deployment
+This project builds to static HTML/CSS/JS. You can deploy `dist/` to any static host (e.g., GitHub Pages, Cloudflare Pages, Netlify, Vercel static sites).

src/content/notes/data-structure-set-in-javascript.md

@@ -0,0 +1,182 @@
+---
+title: 'Data Structure: Set in JavaScript'
+description: 'Unique values collection, operations, iteration, conversions, set algebra, performance, and pitfalls.'
+pubDate: 'Jan 3 2026'
+tags: 'js-data-structure'
+---
+
+## Overview
+
+Sets store unique values of any type and are ideal for deduplication and membership checks.
+
+Sets can contain mixed types (numbers, strings, objects).
+
+Sets are dynamic—no fixed size needed.
+
+Sets preserve insertion order when iterating.
+
+Sets are iterable and work with `for...of` and `forEach`.
+
+Set vs Array
+- Arrays allow duplicates; Sets do not.
+- Arrays use index access; Sets use membership checks and iteration.
+- Typical membership tests and deletes in Sets are O(1).
+
+
+## Creating Sets
+
+```js
+const set = new Set([1, 2, 3]);
+const mixed = new Set([1, '1', { a: 1 }]);
+for (const item of set) console.log(item);
+```
+
+Result:
+```
+1
+2
+3
+```
+
+## Add & Remove
+
+```js
+set.add(4);
+set.add(4);
+```
+
+Result:
+```
+1
+2
+3
+4
+```
+
+Check membership:
+
+```
+console.log(set.has(4));
+```
+
+Result:
+```
+true
+```
+
+Remove values:
+
+```
+set.delete(4);
+```
+
+Result:
+
+```
+1
+2
+3
+```
+
+Size:
+
+```
+console.log(set.size);
+```
+
+Result:
+```
+3
+```
+
+Clear:
+
+```
+set.clear();
+```
+
+Result:
+```
+console.log(set.size);
+0
+```
+
+## Conversions
+
+Array ↔ Set:
+
+```js
+const arr = [1, 2, 2, 3];
+const s = new Set(arr);
+const back = [...s];
+```
+
+Result:
+```
+[1, 2, 3]
+```
+
+Deduplicate arrays:
+
+```js
+const unique = xs => [...new Set(xs)];
+unique([1, 1, 2, 3, 2]);
+```
+
+Result:
+```
+[1, 2, 3]
+```
+
+## Set Algebra
+
+```js
+const union = (A, B) => new Set([...A, ...B]);
+const intersection = (A, B) => {
+  const out = new Set();
+  for (const v of A) if (B.has(v)) out.add(v);
+  return out;
+};
+const difference = (A, B) => {
+  const out = new Set();
+  for (const v of A) if (!B.has(v)) out.add(v);
+  return out;
+};
+const isSubset = (A, B) => {
+  for (const v of A) if (!B.has(v)) return false;
+  return true;
+};
+```
+
+Examples:
+
+```js
+const A = new Set([1, 2, 3]);
+const B = new Set([2, 3, 4]);
+[...union(A, B)];
+[...intersection(A, B)];
+[...difference(A, B)];
+isSubset(new Set([2, 3]), A);
+```
+
+Result:
+```
+[1, 2, 3, 4]
+[2, 3]
+[1]
+true
+```
+
+## Big‑O Complexity
+
+| Operation           | Complexity |
+| ------------------- | ---------- |
+| has / add / delete  | O(1)       |
+| clear / size        | O(1)       |
+| iterate             | O(n)       |
+
+## Notes & Pitfalls
+
+- Object equality is by reference
+- No index access—iterate or convert to array
+- Cache conversions for large sets to avoid repeated cost