Add Coding Interview Fight Club: from-scratch mdBook with Night Owl theme

- Tree-structured mdBook (SUMMARY-driven sidebar) explaining the codebase
- Chapter 1: Binary Search (all 22 problems) - full treatment
- Chapter 2: Dynamic Programming (7 problems so far) - full treatment
- Every problem: intuition, multiple approaches, 5-language code
  (Kotlin/Java/C++/typed Python/Rust) with @param/@return contracts,
  hand-traced dry runs, and math-backed complexity analysis
- Night Owl theme (custom CSS + JS language tabs + copy buttons),
  MathJax math support, search, print
- GitHub Actions workflow (mdbook.yml) deploying to GitHub Pages
- All code samples verified by compiling/running Java, C++, Python, Rust;
  Kotlin sources compiled with kotlinc 2.1.20

Author: arpanpathak

.github/workflows/mdbook.yml

@@ -0,0 +1,44 @@
+name: Deploy mdBook to GitHub Pages
+
+on:
+  push:
+    branches: [main]
+  workflow_dispatch:
+
+permissions:
+  contents: read
+  pages: write
+  id-token: write
+
+concurrency:
+  group: pages
+  cancel-in-progress: true
+
+jobs:
+  build:
+    runs-on: ubuntu-latest
+    steps:
+      - name: Checkout
+        uses: actions/checkout@v4
+      - name: Install mdBook
+        run: |
+          curl -sSL https://github.com/rust-lang/mdBook/releases/download/v0.5.4/mdbook-v0.5.4-x86_64-unknown-linux-gnu.tar.gz | tar -xz
+          sudo mv mdbook /usr/local/bin/
+          mdbook --version
+      - name: Build book
+        working-directory: CodingInterviewFightClub
+        run: mdbook build
+      - name: Upload Pages artifact
+        uses: actions/upload-pages-artifact@v3
+        with:
+          path: CodingInterviewFightClub/book
+  deploy:
+    environment:
+      name: github-pages
+      url: ${{ steps.deployment.outputs.page_url }}
+    runs-on: ubuntu-latest
+    needs: build
+    steps:
+      - name: Deploy to GitHub Pages
+        id: deployment
+        uses: actions/deploy-pages@v4

.gitignore

@@ -0,0 +1,22 @@
+# Gradle / Kotlin
+.gradle/
+build/
+*.class
+*.jar
+.kotlin/
+
+# IDE
+.idea/
+.vscode/
+*.iml
+
+# mdBook build output (deployed by GitHub Actions)
+/book/
+/CodingInterviewFightClub/book/
+
+# OS
+.DS_Store
+
+# Misc binaries
+main
+minikube-darwin-amd64

CodingInterviewFightClub/book.toml

@@ -0,0 +1,27 @@
+[book]
+title = "Coding Interview Fight Club"
+authors = ["Arpan Pathak"]
+language = "en"
+description = "A complete, deeply-explained, multi-language (Kotlin, Java, C++, Python, Rust) guide to the algorithm solutions in the Algorithms_Kotlin codebase. Every problem ships with intuition, multiple approaches, 5-language code annotated with @param/@return docs, hand-traced dry runs, and math-backed time & space complexity analysis."
+
+[build]
+build-dir = "book"
+create-missing = false
+
+[output.html]
+default-theme = "navy"
+preferred-dark-theme = "navy"
+mathjax-support = true
+git-repository-url = "https://github.com/arpanpathak/Algorithms_Kotlin"
+edit-url-template = "https://github.com/arpanpathak/Algorithms_Kotlin/edit/main/src/{path}"
+additional-css = ["theme/css/nightowl.css"]
+additional-js = ["theme/js/book.js"]
+no-section-label = true
+
+[output.html.fold]
+enable = true
+level = 1
+
+[output.html.search]
+limit-results = 20
+teaser-word-count = 30

CodingInterviewFightClub/src/SUMMARY.md

@@ -0,0 +1,43 @@
+# Summary
+
+[Introduction](intro/introduction.md)
+
+- [How To Read This Book](intro/how-to-read.md)
+- [The 5-Language Codebase](intro/the-codebase.md)
+
+- [Reference: Big-O & Complexity Math](reference/complexity.md)
+
+- [1. Binary Search](ch01-binary-search/index.md)
+  - [1.0 Pattern Primer: The Binary Search Theorem](ch01-binary-search/pattern-primer.md)
+  - [1.1 Koko Eating Bananas](ch01-binary-search/koko-eating-bananas.md)
+  - [1.2 Capacity To Ship Packages Within D Days](ch01-binary-search/capacity-to-ship-packages.md)
+  - [1.3 Find First And Last Position Of Target](ch01-binary-search/find-first-and-last-position.md)
+  - [1.4 Find K Closest Elements](ch01-binary-search/find-k-closest-elements.md)
+  - [1.5 Find Minimum In Rotated Sorted Array](ch01-binary-search/find-minimum-in-rotated-sorted-array.md)
+  - [1.6 Find Peak Element](ch01-binary-search/find-peak-element.md)
+  - [1.7 Find Peak Element (Safe Boundaries)](ch01-binary-search/find-peak-element-safe.md)
+  - [1.8 First Bad Version](ch01-binary-search/first-bad-version.md)
+  - [1.9 Guess Number Higher Or Lower](ch01-binary-search/guess-number-higher-or-lower.md)
+  - [1.10 House Robber IV](ch01-binary-search/house-robber-iv.md)
+  - [1.11 Kth Missing Positive Number](ch01-binary-search/kth-missing-positive-number.md)
+  - [1.12 Median Of Two Sorted Arrays](ch01-binary-search/median-of-two-sorted-arrays.md)
+  - [1.13 Peak Index In A Mountain Array](ch01-binary-search/peak-index-in-mountain-array.md)
+  - [1.14 Random Pick With Weight](ch01-binary-search/random-pick-with-weight.md)
+  - [1.15 Search A 2D Matrix](ch01-binary-search/search-a-2d-matrix.md)
+  - [1.16 Search In Rotated Sorted Array II](ch01-binary-search/search-in-rotated-sorted-array-ii.md)
+  - [1.17 Search In Rotated Sorted Array](ch01-binary-search/search-in-rotated-sorted-array.md)
+  - [1.18 Search Insert Position](ch01-binary-search/search-insert-position.md)
+  - [1.19 Single Element In A Sorted Array](ch01-binary-search/single-element-in-a-sorted-array.md)
+  - [1.20 Valley Element](ch01-binary-search/valley-element.md)
+  - [1.21 Apartment Hunting](ch01-binary-search/apartment-hunting.md)
+  - [1.22 Closest Subsequence Sum](ch01-binary-search/closest-subsequence-sum.md)
+
+- [2. Dynamic Programming](ch02-dynamic-programming/index.md)
+  - [2.0 Pattern Primer: Organized Recursion](ch02-dynamic-programming/pattern-primer.md)
+  - [2.1 Longest Common Substring](ch02-dynamic-programming/longest-common-substring.md)
+  - [2.2 Minimum Edit Distance](ch02-dynamic-programming/minimum-edit-distance.md)
+  - [2.3 Longest Common Subsequence](ch02-dynamic-programming/longest-common-subsequence.md)
+  - [2.4 0/1 Knapsack](ch02-dynamic-programming/zero-one-knapsack.md)
+  - [2.5 Unbounded Knapsack](ch02-dynamic-programming/unbounded-knapsack.md)
+  - [2.6 Partition Equal Subset Sum](ch02-dynamic-programming/partition-equal-subset-sum.md)
+  - [2.7 Maximum Product Subarray](ch02-dynamic-programming/maximum-product-subarray.md)