AlgoBuddy
Your algorithm wingman for VS Code. Type a coding problem, get the perfect algo with clean, copyable code—instantly. Built for devs who want solutions fast, with a sleek UI and zero fluff.
10 common problems covered (two-sum, sorting, BFS, and more).
Dark/light themes to match your vibe.
One-click copy for ready-to-paste code.
Current version: 0.1.0 | Released: March 08, 2025
Features
Problem-to-Algo Matching: Enter a problem (e.g., "sort an array"), get the best algorithm (e.g., QuickSort).
Clean Code Snippets: Well-indented, practical JS code you can drop right into your project.
Slick UI: Webview panel with a fade-in animation, theme toggle, and hover tooltips.
Smart Scoring: Keyword-based matching picks the right algo with high accuracy.
Installation
Marketplace:
Search for "AlgoBuddy" in the VS Code Extensions view (Ctrl+Shift+X) and hit "Install".
Or grab it here: AlgoBuddy on Marketplace (update with your link).
Usage
- Open the Command Palette: Ctrl+Shift+P (or Cmd+Shift+P on Mac).
- Type "AlgoBuddy: Suggest Algorithm" and hit Enter.
- Enter your problem (e.g., "find two numbers that sum to a target").
- Boom—a panel pops up with:
Algorithm name and time complexity (e.g., "Hash Table, O(n)").
Why it works.
Clean code to copy with one click.
Toggle the theme (🌙/☀️) if you’re feeling fancy.
Examples:
"Sort an array" → QuickSort, O(n log n).
"Shortest path in graph" → BFS, O(V + E).
"Check if palindrome" → Two-Pointer, O(n).
AlgoBuddy Premium Setup Guide
Unlock the full power of AlgoBuddy with a Premium subscription for just $4.99! This guide walks you through subscribing, retrieving your license key (certificate), and activating it in the VS Code extension to access premium algorithms like QuickSort and Kadane’s Algorithm.
Step 1: Subscribe to AlgoBuddy Premium
Visit the Subscription Page:
Head to https://algobuddyserver-next.vercel.app.
Enter Your Email: Provide a valid email address to receive your subscription details.
Complete Payment:
- Price: $4.99 (one-time or recurring, depending on your plan—check the site for details).
- Pay securely via Paystack using your preferred method (card, bank, etc.).
Success Page: After payment, you’ll be redirected to a success page displaying your unique license key (e.g., algo-xyz123).
Tip: Copy this key immediately—it’s your Premium certificate!
Step 2: Install the AlgoBuddy Extension
- Get the Extension:
- Reload VS Code:
- Restart VS Code to activate the extension.
Step 2: Install the AlgoBuddy Extension
- Launch AlgoBuddy : Open VS Code after installing the extension.
- On first use, you’ll see a welcome message: "Welcome to AlgoBuddy! Set a license key to unlock premium features?"
- Click Yes to proceed (or skip to manual setup below).
- Enter Your Key:
- In the input box, paste your license key (e.g., algo-xyz123) from Step 1.
- Press Enter—AlgoBuddy will validate it against our server.
- Confirmation
- Success: "License key validated! Expires: [date]"
- Error: If it fails (e.g., invalid key), double-check your key or contact support (see below).
Manual Setup###
- Open Command Palette (Ctrl+Shift+P or Cmd+Shift+P).
- Run "AlgoBuddy: Set License Key" → Paste your key.
Step 4: Enjoy Premium Features##
- Run "AlgoBuddy: Suggest Algorithm" from the Command Palette.
- Enter a problem (e.g., "sort an array")—premium users get advanced solutions like QuickSort, while free users are limited to basic algorithms.
- Your key is stored securely in VS Code settings (algobuddy.licenseKey) and checked on each use.
Troubleshooting##
- 404 Error: If you see "Validation endpoint not found", ensure your key is correct and our server is up (check status).
- Invalid Key: Verify you copied the full key from the success page. Keys look like algo-xyz123.
- Need Help?: Email us at apptuned2025@gmail.co or open an issue on GitHub.
Pricing
- Cost: $7.99/month or $99/year (save 17%!)
- Launch Special: First 100 subscribers get $4.99/month—lock it in now!
- Value: Premium algorithms, seamless VS Code integration, and priority updates.
**Get coding smarter with AlgoBuddy Premium—subscribe today! **
Supported Problems
Algorithm Library
AlgoBuddy offers 50 algorithms to supercharge your coding, with 15 free and 35 premium options at $7.99/month. Insert them directly into your editor!
Free Algorithms (15)
- Two Numbers: Hash Table (O(n))
- Find Duplicates: Hash Set (O(n))
- Binary Search: Binary Search (O(log n))
- String Matching: Naive String Matching (O(n * m))
- Palindrome: Two-Pointer (O(n))
- Factorial: Recursion (O(n))
- Reverse Array: Two-Pointer Swap (O(n))
- Fibonacci: Iterative (O(n))
- Linked List Cycle: Floyd’s Cycle Detection (O(n))
- Stack Implementation: Array-Based Stack (O(1))
- Queue Implementation: Array-Based Queue (O(1))
- Bubble Sort: Bubble Sort (O(n²))
- Selection Sort: Selection Sort (O(n²))
- Insertion Sort: Insertion Sort (O(n²))
- Linear Search: Linear Search (O(n))
Premium Algorithms (35)
- Sort an Array: QuickSort (O(n log n))
- Max Subarray: Kadane’s Algorithm (O(n))
- Graph Traversal: Depth-First Search (DFS) (O(V + E))
- Shortest Path: Breadth-First Search (BFS) (O(V + E))
- Merge Sort: Merge Sort (O(n log n))
- Heap Sort: Heap Sort (O(n log n))
- Dijkstra: Dijkstra’s Algorithm (O((V + E) log V))
- Topological Sort: Topological Sort (DFS) (O(V + E))
- KMP String: Knuth-Morris-Pratt (O(n + m))
- Longest Common Subsequence: Dynamic Programming (LCS) (O(m * n))
- Minimum Spanning Tree: Kruskal’s Algorithm (O(E log E))
- Trie Search: Trie (Prefix Tree) (O(m))
- Matrix Rotation: In-Place Matrix Rotation (O(n²))
- Sliding Window: Sliding Window (Max Sum) (O(n))
- Bellman-Ford: Bellman-Ford Algorithm (O(V * E))
- Floyd-Warshall: Floyd-Warshall Algorithm (O(V³))
- Prim: Prim’s Algorithm (O(E log V))
- Rabin-Karp: Rabin-Karp Algorithm (O(n + m))
- Boyer-Moore: Boyer-Moore Algorithm (O(n/m))
- Longest Palindrome: Manacher’s Algorithm (O(n))
- Edit Distance: Levenshtein Distance (DP) (O(m * n))
- Knapsack: 0/1 Knapsack (DP) (O(n * W))
- Coin Change: Coin Change (DP) (O(n * amount))
- Subset Sum: Subset Sum (DP) (O(n * sum))
- Union-Find: Union-Find (Disjoint Set) (O(α(n)))
- AVL Tree: AVL Tree Insertion (O(log n))
- Red-Black Tree: Red-Black Tree Insertion (O(log n))
- Segment Tree: Segment Tree (Range Sum) (O(log n))
- Fenwick Tree: Fenwick Tree (BIT) (O(log n))
- Suffix Array: Suffix Array (O(n log n))
- Max Flow: Ford-Fulkerson (DFS) (O(E * |f|))
Total: 50 algorithms—15 free to get you started, 35 premium for power users!
More coming in future updates—drop suggestions!
Pricing
- Free: 3 algos, basic UI.
- Premium: $5/month for all algos + extras. Get your key atyour-site.com.
Calling out known issues can help limit users opening duplicate issues against your extension.
Release Notes
1.0.0
Initial release of AlgoBuddy
0.4.0
Added premium subscription feature.
Updated readme for notes on setting up AlgoBuddy Premium
License
MIT—use it, tweak it, share it.
