DSA Handbook (Java Edition) — v2.2.0
Structured, printable PDF study notes for Data Structures & Algorithms in Java. Shallow-to-medium depth: clear enough to learn quickly, deep enough for interviews.
153 pages · 11 chapters · XeLaTeX · A4 · Interview-oriented
What’s inside
Every major topic follows: Explanation → Java code → Dry-run table → TikZ diagram → Complexity → Interview corner.
| Ch | Topic |
|---|---|
| 1 | Programming fundamentals, JVM, pseudocode |
| 2 | Java basics, I/O, control flow, 26 pattern problems |
| 3 | Time & space complexity (Big-O) |
| 4 | Math for DSA (digits, GCD, primes) |
| 5 | 1-D arrays & hashing / two-pointer |
| 6 | Array problems — interview revision |
| 7 | Sorting (Selection through Tim Sort) |
| 8 | ArrayList & 2-D dynamic lists |
| 9 | Medium arrays (Dutch flag, Kadane, 3-Sum, etc.) |
| 10 | 2-D arrays / matrices |
| 11 | Hard arrays (merge in-place, rainwater, stocks, inversions) |
v2 highlights
- Optimized layouts, corrected math notation, TikZ memory maps
- GitHub-light code blocks, branded headers, watermark on every page
- Verified Java implementations with dry-run trace tables
Download
- PDF (this release): attach
DSA_Handbook_CH_1-11.pdfbelow - Always on
main: v2/DSA_Handbook_CH_1-11.pdf - Source: v2/DSA_Handbook_CH_1-11.tex
Build locally
./build_handbook.ps1