Sameer's DSA Journey

Structure

Eleetcode/
├── Array/              ← Java solution files (one file per problem)
├── HolyBook/           ← All reference material — read these, not this file
│   ├── General_HolyBook.md   ← Universal patterns, complexity, tradeoffs
│   ├── Array_HolyBook.md     ← Array-specific patterns + all problem logs
│   └── Array_Interview.md    ← Interview Q&A, follow-ups, company notes
└── README.md

---

Workflow

1. READ    → Understand problem. Note: sorted? range [1..n]? window?
2. MATCH   → Open Array_HolyBook.md Section 1. Find the signal → pattern.
3. CODE    → Implement without looking at solutions.
4. ANALYZE → Compare your complexity vs optimal. Note what you missed.
5. SYNC    → Update HolyBook + Tracker after every problem.

---

Where Is Everything?

What you need	Where to look
n-size → time ceiling	General_HolyBook.md Section 2
Space vs time tradeoff	General_HolyBook.md Section 3
Pattern glossary	Array_HolyBook.md Section 1
All solved problems + notes	Array_HolyBook.md Section 2
Interview Q&A	Array_Interview.md
Progress tracker	Resource/DSA_Journey_Tracker.csv

---

Topics Roadmap

• Array
• String
• LinkedList
• Binary Search
• Stack / Queue
• Tree
• Graph
• Dynamic Programming