01
Pattern recognition
Connect new problems to familiar structures without jumping to a memorized answer.
All learning paths
Path 04USACO
Solve harder problems witha sharper process.
Focused algorithm practice that teaches students to break down unfamiliar problems, compare approaches, and write efficient solutions under pressure.
Weekly mentorship starting at $45
Project-first learning
The core skill
Reason first. Then code.Students learn to explain the approach, prove why it works, and measure its efficiency.- Grades
- 6–8
- Experience
- Expert
- Cadence
- Weekly
- Format
- 1-on-1 online
Algorithmic problem-solving
Practice that builds a repeatable process.
Instead of memorizing isolated tricks, students learn to recognize patterns, choose useful data structures, test assumptions, and improve a solution step by step.
02
Algorithm design
Compare brute force and optimized approaches, then justify the final strategy.
03
Complexity analysis
Reason about runtime and memory so performance becomes part of the solution.
04
Contest readiness
Practice time management, careful reading, debugging, and recovery when an approach stalls.
A path that stays personal
Train toward the challenge that motivates them.
The same core reasoning supports competition and interview-style practice, but sessions can emphasize the format that best matches the student’s goal.
Challenge track 01
USACO training
Build the knowledge and contest habits needed to progress through USACO divisions.
- Bronze and Silver foundations
- Past contest problem analysis
- Timed contest simulations
Challenge track 02
LeetCode mastery
Develop a structured approach to common algorithm families and technical questions.
- Pattern-based practice sets
- Time and space optimization
- Clear solution walkthroughs
Curriculum roadmap
Build depth before chasing speed.
The sequence adapts to current knowledge, but every stage combines concept study, deliberate practice, implementation, and reflection.
The pace adapts week by week
Stage one
Core structures
Gain fluency with arrays, strings, sets, maps, stacks, queues, sorting, and binary search.Stage two
Traversal and graphs
Model relationships and apply BFS, DFS, shortest paths, trees, and topological order.Stage three
Optimization patterns
Work with greedy reasoning, prefix sums, two pointers, dynamic programming, and state design.Stage four
Contest strategy
Choose problems, manage time, test edge cases, debug efficiently, and review performance.
Work they can show
Proof of progress you can run.
Algorithm work becomes more tangible through visual tools, structured challenge sets, and clear explanations of increasingly efficient solutions.
Graph theory
Pathfinding visualizer
Compare how BFS, DFS, and shortest-path algorithms explore the same network.
GraphsBFSDijkstra
Practice system
Challenge set tracker
Organize problems by pattern, record attempts, and surface topics that need review.
PatternsMetricsReflection
Contest prep
USACO training plan
Build a targeted practice roadmap from solved problems, timing, and error patterns.
USACOStrategyReview
The Evergreen difference
Serious practice without the pressure spiral.
A mentor makes challenge productive: asking the right questions, helping students review misses, and keeping difficulty at the edge of what is achievable.
01
Concept before shortcuts
Students understand why an approach works and when it can be reused.
02
Deliberate problem sets
Practice is chosen to strengthen a specific pattern, gap, or contest skill.
03
Detailed solution review
Every miss becomes data for improving reasoning, implementation, or time management.
Keep exploring
Explore another learning path.
Is this the right path?