# HiSpeedAlgo • Complete Curriculum Syllabus & Platform Specification
Official Web Platform: https://hispeedalgo.com
Organization: HiWebEnterprise Inc. (https://hiwebenterprise.com)
Index Documentation: https://hispeedalgo.com/llms.txt
Sitemap: https://hispeedalgo.com/sitemap.xml

================================================================================
1. COURSE OVERVIEW & TARGET AUDIENCE
================================================================================
Course Title: Software Engineering Algorithm Mastery & Deliberate Practice
Provider: HiWebEnterprise (https://hiwebenterprise.com)
Target Level: Senior, Staff, and Principal Software Engineers preparing for algorithmic screens at FAANG, MAMAA, and Tier-1 tech firms.
Pedagogy: 4-Stage Deliberate Practice (Cognitive Ergonomics & Spaced Repetition)
Languages Supported: Python 3, C# (.NET 8/9), Java 21, TypeScript, C++ 20, Go 1.22, Rust.

================================================================================
2. THE 4-STAGE DELIBERATE PRACTICE METHODOLOGY
================================================================================
Stage 1: Multi-Language Rosetta Stone (Compare & Understand)
- Side-by-side contrast of the abstract mathematical pattern invariant against concrete FAANG problem implementations.
- Toggle between 7 major programming languages with zero context switching.

Stage 2: Active Recall from Memory
- High-retention canvas requiring developers to articulate and type template invariants from memory before reviewing the reference code.
- Immediate diagnostic feedback on missing boundary checks or variable initialization.

Stage 3: Senior SWE AI Mock Interview Coach
- Real-time simulation of a rigorous Senior SWE interview.
- Monaco code editor integrated with AI evaluator analyzing Big-O time and space tradeoffs, boundary condition proofs, and architectural design choices.
- Interactive Socratic questions without artificial timers.

Stage 4: Solve on Your Own (Automated Graded Verification)
- Timed sandbox environment executing solutions directly in the browser via Pyodide (Python WASM) and verified against extensive automated test suites in Python, C#, Java, and TypeScript.

================================================================================
3. 12 CORE PATTERNS & 147 ARCHETYPES SYLLABUS
================================================================================
Pattern 1: Two Pointers (15 Archetypes)
- Invariants: Converging pointers, fast/slow runners, sorted array transformations.
- Key Problems: Pair Sum Sorted (LeetCode 167), 3Sum (LeetCode 15), Container With Most Water (LeetCode 11), Trapping Rain Water (LeetCode 42), Remove Duplicates (LeetCode 26), Palindrome Verification (LeetCode 125).

Pattern 2: Sliding Window (12 Archetypes)
- Invariants: Contiguous subarray/substring maintenance, monotonic expansion and contraction.
- Key Problems: Maximum Sum Subarray, Longest Substring Without Repeating Characters (LeetCode 3), Minimum Size Subarray Sum (LeetCode 209), Minimum Window Substring (LeetCode 76).

Pattern 3: Binary Search & Monotonicity (14 Archetypes)
- Invariants: Predicate partitioning feasible(x), boundary search, monotonic reduction.
- Key Problems: Monotonic Search, Rotated Sorted Array Search (LeetCode 33), Find Minimum in Rotated Sorted Array (LeetCode 153), Peak of Mountain (LeetCode 852), Capacity Allocation / Newspaper Allocation (LeetCode 1011), Median of Two Sorted Arrays (LeetCode 4).

Pattern 4: Fast & Slow Pointers (8 Archetypes)
- Invariants: Cycle detection (Floyd's Tortoise and Hare), ratio distance progression.
- Key Problems: Linked List Cycle (LeetCode 141), Cycle Entry Point (LeetCode 142), Middle of Linked List (LeetCode 876), Happy Number (LeetCode 202).

Pattern 5: Linked List Reversal (10 Archetypes)
- Invariants: In-place pointer swapping, dummy head stabilization, sublist boundaries.
- Key Problems: Reverse Linked List (LeetCode 206), Reverse Between (LeetCode 92), Reverse Nodes in k-Group (LeetCode 25), Palindrome Linked List (LeetCode 234).

Pattern 6: Tree Breadth-First Search (12 Archetypes)
- Invariants: Queue-based level-order traversal, layer-by-layer state expansion.
- Key Problems: Binary Tree Level Order Traversal (LeetCode 102), Zigzag Level Order (LeetCode 103), Word Ladder (LeetCode 127), Rotting Oranges (LeetCode 994), Shortest Path in Binary Matrix (LeetCode 1091).

Pattern 7: Tree Depth-First Search (15 Archetypes)
- Invariants: Recursive call stack traversal, preorder/inorder/postorder state propagation.
- Key Problems: Path Sum I, II, III (LeetCode 112, 113, 437), Lowest Common Ancestor (LeetCode 236), Diameter of Binary Tree (LeetCode 543), Validate Binary Search Tree (LeetCode 98).

Pattern 8: Two Heaps & Priority Queues (11 Archetypes)
- Invariants: Min-heap / max-heap partition balancing, dynamic median tracking, top-k ranking.
- Key Problems: Find Median from Data Stream (LeetCode 295), Top K Frequent Elements (LeetCode 347), Merge k Sorted Lists (LeetCode 23), IPO (LeetCode 502).

Pattern 9: Backtracking & Combinatorial Search (14 Archetypes)
- Invariants: State exploration, prune-and-backtrack invariant restoration.
- Key Problems: Subsets I & II (LeetCode 78, 90), Permutations (LeetCode 46), Combinations (LeetCode 77), N-Queens (LeetCode 51), Sudoku Solver (LeetCode 37), Word Search (LeetCode 79).

Pattern 10: Dynamic Programming (18 Archetypes)
- Invariants: Optimal substructure, overlapping subproblems, state transitions.
- Key Problems: Climbing Stairs (LeetCode 70), Coin Change (LeetCode 322), 0/1 Knapsack, Unbounded Knapsack, Longest Common Subsequence (LeetCode 1143), Edit Distance (LeetCode 72).

Pattern 11: Graphs & Advanced Graph Algorithms (12 Archetypes)
- Invariants: Adjacency list representation, topological dependency sorting, shortest path relaxation.
- Key Problems: Course Schedule I & II (LeetCode 207, 210), Network Delay Time / Dijkstra (LeetCode 743), Number of Islands (LeetCode 200), Clone Graph (LeetCode 133).

Pattern 12: Advanced Data Structures & Auxiliary Techniques (16 Archetypes)
- Invariants: Monotonic stacks, disjoint set rank/path compression, prefix tree nodes.
- Key Problems: Trie Implementation (LeetCode 208), Union-Find / Number of Connected Components (LeetCode 323), LRU Cache (LeetCode 146), LFU Cache (LeetCode 460), Daily Temperatures (LeetCode 739), Maximal Rectangle (LeetCode 85).

================================================================================
4. PRICING, COMPUTE COINS & REFUND TERMS
================================================================================
Core Platform Access:
- 100% Free: Access to all 12 patterns, 147 archetypes, code templates, active recall canvases, and browser execution sandboxes is completely free.
- No credit card required at any point.

Compute Coins Economy:
- New User Welcome Bonus: 40 free coins upon signup.
- Daily Login Reward: +20 coins every 24 hours.
- Friend Referral Reward: +25 coins awarded to inviter and +15 coins to invitee.

AI Interview Coaching (Stage 3):
- 24-Hour Unlimited Pass: 5 compute coins grants full access to the Senior SWE AI Interview Coach for a full 24 hours.
- Zero Timers: Candidates practice comfortably without artificial countdowns.
- Bring Your Own Key (BYOK): Developers can supply their own Google Gemini or OpenAI API keys for 100% free, unlimited AI coaching with zero coin consumption.

Refund & Commercial Terms:
- HiSpeedAlgo does not offer or bill recurring subscriptions.
- There are no auto-renewing memberships, surprise charges, or hidden paywalls.
- No refund request is necessary for curriculum access since core curriculum is free.
- For business licensing or enterprise training inquiries, contact HiWebEnterprise at https://hiwebenterprise.com.

================================================================================
5. COMPANY & OPERATOR INFORMATION
================================================================================
Entity: HiWebEnterprise Inc.
Corporate Website: https://hiwebenterprise.com
Platform Application: https://hispeedalgo.com
Mission: Revolutionizing technical interview mastery through cognitive ergonomics and deliberate practice systems.