vaskes/algorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
a1bdd7b8791eb3ce017f506e73ae95af3bc0e09e
algorithms/docs/progress.md
T

2.4 KiB
Raw Blame History

Algorithm Learning Progress

Current Status: Ready to Begin Phase 1

Phase 1: Foundations (Weeks 1-4) - Not Started

  • Week 1: Array basics completed
  • Week 2: Two pointers mastered
  • Week 3: Binary search mastered
  • Week 4: Prefix sums completed

Phase 2: Intermediate Patterns (Weeks 5-8) - Not Started

  • Week 5: String patterns mastered
  • Week 6: Advanced string patterns
  • Week 7: Hash map fundamentals
  • Week 8: Advanced hash patterns

Phase 3: Advanced Patterns (Weeks 9-12) - Not Started

  • Week 9: Dynamic programming basics
  • Week 10: 1D Dynamic programming
  • Week 11: 2D Dynamic programming
  • Week 12: Advanced DP patterns

Phase 4: Advanced Topics (Weeks 13-16) - Not Started

  • Week 13: Graph algorithms basics
  • Week 14: Advanced graph algorithms
  • Week 15: Tree algorithms
  • Week 16: Complex problem solving

Problem Solving Statistics

  • Total problems solved: 0
  • Easy problems: 0
  • Medium problems: 0
  • Hard problems: 0
  • Success rate: 0%
  • Average solve time: N/A

Skill Assessment (1-5 stars)

  • Array manipulation: ⭐⭐⭐⭐⭐ (Not assessed)
  • String processing: ⭐⭐⭐⭐⭐ (Not assessed)
  • Binary search: ⭐⭐⭐⭐⭐ (Not assessed)
  • Hash tables: ⭐⭐⭐⭐⭐ (Not assessed)
  • Dynamic programming: ⭐⭐⭐⭐⭐ (Not assessed)
  • Graph algorithms: ⭐⭐⭐⭐⭐ (Not assessed)
  • Pattern recognition: ⭐⭐⭐⭐⭐ (Not assessed)

Learning Goals

  • Short-term (1 month): Complete Phase 1, solve 30+ problems
  • Medium-term (3 months): Complete Phase 2, solve 100+ problems
  • Long-term (6 months): Complete all phases, solve 200+ problems

Current Week Focus

Week 1 (Starting 2026-05-17): Array basics and simple patterns

  • Primary focus: Linear search, basic array operations
  • Secondary focus: Simple frequency counting
  • Target problems: 2-3 per day
  • Difficulty level: Easy only

Strengths & Weaknesses

Identified Strengths: None yet - starting fresh Identified Weaknesses: None yet - starting fresh Areas to Focus: Array traversal and basic operations

Notes

  • First day of learning: 2026-05-17
  • Repository has 16 existing algorithms to reference
  • Focus on understanding before moving to next topic
  • Daily practice goal: 30-60 minutes

Last Updated: 2026-05-17 Next Review: 2026-05-24 (End of Week 1)

Reference in New Issue View Git Blame Copy Permalink