# DSA Buddies — Comprehensive Technical & Architectural Documentation

> Official full documentation for LLMs, RAG agents, and Answer Engines indexing DSA Buddies (https://www.dsabuddies.com/).

## Overview

DSA Buddies is a modern web application and technical interview preparation suite engineered for aspiring and professional Software Engineers (SDE I, SDE II, Senior SDE, Tech Lead). It bridges the gap between passive problem memorization and high-stakes technical interview execution through active recall, spaced repetition, peer competition, and real-time live coding arenas.

---

## Key Modules & Platform Features

### 1. Curated Problem Sheets & Roadmaps
- **Supported Sheets**: Striver SDE Sheet (180+ curated core problems), NeetCode 150 (curated blind patterns), Blind 75, Weekly & Daily Challenges.
- **Problem Metadata**: Difficulty (Easy, Medium, Hard), Problem Category/Topic, Platform Link (LeetCode, CodeStudio, GeeksforGeeks), XP Rewards, Company Tags (Google, Amazon, Microsoft, Meta, Apple), Pattern Tags (Sliding Window, Monotonic Stack, Two Pointers).
- **Integrated Video Solutions**: One-click targeted YouTube solution search matching the problem title and algorithmic pattern directly inside problem rows and modals.

### 2. Real-Time 1v1 Algorithmic Battle Arena
- **Arena Dynamics**: Users can challenge any candidate on the platform to live 1v1 algorithmic duels.
- **Wager Mechanism**: Contenders wager platform XP (from 25 to 500+ XP). Winner claims the pooled bounty.
- **Live Synchronization**: Real-time timer countdowns, problem specifications, and match resolutions.
- **Anti-Cheat & Proctoring**: Window violation detectors, focus loss tracking, and disqualification rules for official championships.

### 3. Spaced Repetition Flashcard Engine (SuperMemo SM-2)
- **Algorithm**: Implements the SuperMemo SM-2 spaced repetition algorithm to schedule problem reviews.
- **Retention**: Calculates optimal review intervals (1, 6, 14, 30 days) and easiness factors based on user self-evaluation grades (0 to 5).
- **Active Recall**: Combats the forgetting curve for tricky algorithmic corner cases and mathematical proofs.

### 4. AI-Powered Mock Technical Interviewer
- **Simulated Environments**: Full-stack technical interviews with AI asking algorithmic follow-ups, time/space complexity inquiries, and edge-case verification.
- **Evaluation Rubrics**: Structured feedback on Problem Understanding, Code Correctness, Invariant Handling, and Communication Clarity.

### 5. Last-Minute Refresher Hub (938+ Senior-Depth Questions)
Covers 11 major software engineering interview domains with high technical rigor (30-second pitch, senior technical invariants, code/architecture demonstrations, and takeaways):
1. **System Design (HLD & LLD)**: Consistent Hashing, CQRS, Event Sourcing, Write-Behind Caching, Geohash / H3 Spatial Indexing, Raft Consensus, Merkle Trees, Snowflake ID Generation.
2. **Database Management Systems (DBMS)**: ACID Invariants, MVCC Snapshot Isolation, Strict Two-Phase Locking (SS2PL), Write-Ahead Logging (WAL) ARIES Recovery, B+ Tree Leaf Linking.
3. **SQL Mastery**: Complex Window Functions (ROW_NUMBER, DENSE_RANK, LAG, LEAD), Keyset Cursor Pagination, Recursive Hierarchical CTEs, Sargable Predicates, Trigram Indexes.
4. **Computer Networking**: OSI Encapsulation, TCP 3-Way Handshake, TCP 4-Way Termination (TIME_WAIT, 2*MSL), TLS 1.3 0-RTT Handshake, HTTP/2 Stream Multiplexing, HTTP/3 QUIC UDP Framing.
5. **Operating Systems**: POSIX Threads & Mutexes, Counting Semaphores, Peterson's Algorithm, 4-Level x86-64 Page Tables (PML4, PDPT, PD, PT), TLB Invalidation, Copy-on-Write (CoW).
6. **Object-Oriented Programming (OOPs)**: 23 Gang-of-Four (GoF) Design Patterns, SOLID Principles, Dynamic Dispatch VTable Mechanics, Composition vs Inheritance.
7. **Amazon Web Services (AWS)**: 3-Tier Multi-AZ VPC Topologies, Transit Gateway Hub-and-Spoke, KMS Envelope Encryption, DynamoDB Single-Table Design, SQS FIFO Deduplication.
8. **DevOps & SRE**: Kubernetes Pod Lifecycle Probes, StatefulSets, Prometheus PromQL Metrics & Alertmanager, Terraform Remote S3/DynamoDB State Locking, CI/CD GitHub Actions.
9. **Core Java & Enterprise Java**: JVM Memory Model (Eden, Survivor, Tenured, Metaspace), ZGC/G1 Garbage Collectors, java.util.concurrent Synchronizers (AQS, ReentrantLock, ConcurrentHashMap).
10. **Spring Boot**: Spring Bean Lifecycle, Circular Dependency Resolution, Transaction Propagation (`REQUIRES_NEW`), Virtual Threads (Project Loom).
11. **Coding Patterns**: Two Pointers, Sliding Window, Monotonic Deque, Dynamic Programming State Reductions, Graph Toposort, Disjoint Set Union.

---

## Comprehensive DSA Preparation Methodology

DSA Buddies advocates an active-recall, pattern-based approach rather than random problem grinding:
1. **Phase 1: Foundations & Linear Structures (Weeks 1–3)**
   - Master asymptotic notation: O(1), O(log N), O(N), O(N log N), O(N^2), O(2^N).
   - Arrays, Strings, Two Pointers, Sliding Window (fixed vs dynamic size), Prefix Sum arrays.
   - Singly/Doubly Linked Lists: Pointer reversals, fast/slow Floyd cycle detection, merge sort on lists.
   - Stacks & Queues: FIFO/LIFO mechanics, monotonic stacks for Next Greater Element.
2. **Phase 2: Binary Search & Tree Hierarchies (Weeks 4–6)**
   - Monotonic search spaces: Binary search on answer (Allocate Books, Koko Eating Bananas).
   - Binary Trees: DFS (Pre/In/Postorder), BFS level order, height/diameter, LCA in O(N).
   - Binary Search Trees (BST): In-order sorted property, deletion invariants, range queries.
   - Heaps & Priority Queues: Complete binary tree representation, heapify in O(N), Top-K elements, Median Finder (two-heap technique).
3. **Phase 3: Graphs & Advanced Traversal (Weeks 7–8)**
   - Graph representations: Adjacency list vs adjacency matrix.
   - Breadth-First Search (BFS) for unweighted shortest paths.
   - Depth-First Search (DFS) for connected components and cycle detection.
   - Dijkstra's algorithm for non-negative weighted graphs in O((V + E) log V).
   - Topological Sorting: Kahn's algorithm (indegree queue) & DFS postorder.
   - Disjoint Set Union (DSU / Union-Find) with path compression & union by rank in O(alpha(N)).
4. **Phase 4: Dynamic Programming & Recursion (Weeks 9–10)**
   - Identifying overlapping subproblems & optimal substructure.
   - Memoization (top-down) vs Tabulation (bottom-up) with space optimization.
   - 1D DP: Fibonacci, Climbing Stairs, House Robber, Coin Change.
   - 2D Grid DP: Unique Paths, Minimum Path Sum.
   - Classical Subsequences: Longest Increasing Subsequence (LIS) in O(N log N) via patience sort, Longest Common Subsequence (LCS).
   - 0/1 Knapsack, Unbounded Knapsack, and Target Sum variants.
5. **Phase 5: High-Stakes Battle Testing & Full-Stack Refresher (Weeks 11–12)**
   - 1v1 live peer battles to develop composure under ticking countdowns.
   - SuperMemo SM-2 spaced repetition to solidify tricky patterns permanently.
   - 938+ Refresher questions covering System Design, DBMS, SQL, Networking, OS, and Cloud.

---

## SEO, AEO & GEO Optimization Standards

- **Search Engine Optimization (SEO)**: Clean semantic HTML, canonicalization, OpenGraph / Twitter Cards, high-performance CWV metrics (0ms cached loads).
- **Answer Engine Optimization (AEO)**: Direct 35-word concise answer hooks in Schema.org `FAQPage` and semantic markup for Google AI Overviews, Perplexity, and voice assistants (SpeakableSpecification).
- **Generative Engine Optimization (GEO)**: Explicit standard `/llms.txt` and `/llms-full.txt` files, knowledge graph entity verification (`knowsAbout`, `sameAs`), comprehensive technical benchmarks, and direct LLM citation protocols.

---

## Contact & Links
- Web: https://www.dsabuddies.com/
- Robots File: https://www.dsabuddies.com/robots.txt
- Sitemap: https://www.dsabuddies.com/sitemap.xml
- LLM Guide: https://www.dsabuddies.com/llms.txt