[AI] build roadmap for learning
This commit is contained in:
@@ -0,0 +1,67 @@
|
||||
# Algorithm Learning Journey - Getting Started
|
||||
|
||||
## 🎯 Your Learning Path
|
||||
|
||||
We've created a comprehensive learning system for you! Here's where we start:
|
||||
|
||||
### 📚 Current Setup
|
||||
|
||||
**Documentation Created:**
|
||||
- `docs/learning-plan.md` - Complete 16-week structured plan
|
||||
- `docs/rules.md` - Learning rules and capabilities
|
||||
- `docs/progress.md` - Progress tracking dashboard
|
||||
- `docs/daily-practice.md` - Daily practice log template
|
||||
- `docs/01-foundations/array-basics.md` - Week 1 foundational documentation
|
||||
|
||||
**Current Status:**
|
||||
- **Starting Week**: Week 1 (Array basics)
|
||||
- **Focus**: Array traversal and basic operations
|
||||
- **Difficulty**: Easy problems only
|
||||
- **Daily Goal**: 30-60 minutes, 2-3 problems
|
||||
|
||||
### 🚀 Today's Mission (2026-05-17)
|
||||
|
||||
**Focus**: Array basics - linear search, frequency counting, min/max finding
|
||||
**Practice Problems**: Start with easy array operations
|
||||
**Learning Resources**: Use `docs/01-foundations/array-basics.md`
|
||||
|
||||
### 📋 Tomorrow's Plan
|
||||
|
||||
**Week 1, Day 2**: Two pointers fundamentals
|
||||
- Practice `twoSum` and `maxArea` from repository
|
||||
- Learn two pointers technique on sorted arrays
|
||||
- Solve 2-3 two pointer problems
|
||||
|
||||
### 🎯 Key Learning Principles
|
||||
|
||||
1. **No rush**: Focus on deep understanding
|
||||
2. **Daily practice**: Consistent 30-60 minute sessions
|
||||
3. **Progressive difficulty**: Start easy, build complexity gradually
|
||||
4. **Pattern recognition**: Learn to identify algorithmic patterns
|
||||
5. **Real connections**: Link algorithms to practical programming
|
||||
|
||||
### 💡 How to Use This System
|
||||
|
||||
1. **Start with `docs/daily-practice.md`** - Log your daily progress
|
||||
2. **Follow `docs/learning-plan.md`** - Week by week structure
|
||||
3. **Update `docs/progress.md`** - Track your improvement
|
||||
4. **Use existing algorithms** - Study `lib/` directory implementations
|
||||
5. **Ask questions** - I'm here to explain concepts in simple terms
|
||||
|
||||
### 📊 Progress Tracking
|
||||
|
||||
Your learning will be tracked through:
|
||||
- **Daily logs**: What you practice each day
|
||||
- **Weekly assessments**: Skills improvement and areas to focus
|
||||
- **Monthly reviews**: Overall progress and goal setting
|
||||
- **Skill ratings**: 1-5 star rating for each algorithm category
|
||||
|
||||
---
|
||||
|
||||
**Ready to begin!** 🎉
|
||||
|
||||
Today's focus is on array basics. Take your time, understand each concept, and don't hesitate to ask for clarification on anything. The goal is building a strong foundation for more complex algorithms.
|
||||
|
||||
**Remember**: It's better to understand one concept deeply than to rush through many superficially.
|
||||
|
||||
Let's start with array basics! 🚀
|
||||
Reference in New Issue
Block a user