⚡ Automated GitHub Portfolio Builder

Sync LeetCode Solutions Directly to GitHub

Never lose a solved problem again. Automatically push clean source code, formatted Markdown problem descriptions, accurate runtime/memory stats, and visual Big-O Complexity Graphs to your repository.

/0001-two-sum/README.md
# 1. Two Sum (Easy)

### 📊 Submission Statistics
- Language: `cpp`
- Runtime: `2 ms` (Beats 92.4%)
- Memory: `10.8 MB` (Beats 78.1%)

### 💡 Approach & Complexity Analysis
- Time Complexity: $\mathcal{O}(N)$ — Single linear scan with hash map lookup.
- Space Complexity: $\mathcal{O}(N)$ — Auxiliary hash table storing up to N elements.

#### 📈 Time & Space Complexity Graphs
[ Mermaid XY Growth Chart Rendered Automatically on GitHub ]
💎 Core Capabilities

Everything You Need for Coding Interviews

Built for competitive programmers, interview preparation, and maintaining a GitHub streak.

🚀

Instant Auto-Sync

Detects Accepted verdicts immediately upon submission without requiring manual copy-pasting or tab switching.

📈

Big-O Complexity Graphs

Automatically generates dual Mermaid XY growth charts for Time Complexity and Space Complexity inside every problem README.

📁

Organized Folders

Sorts problems by title padded with IDs (e.g. /0001-two-sum/) or by difficulty levels with customizable tokens.

🌐

Multi-Platform Support

Unifies problem sync across LeetCode, LeetCode CN, Codeforces, and GeeksforGeeks into a single central repository.

🛡️

Zero-Diff Deduplication

Performs Git tree SHA checks before committing, preventing redundant identical commits upon page reloads.

🔐

AES-256 Client Encryption

Your GitHub Personal Access Token is encrypted locally with AES-256-GCM and never sent to any third-party server.

📊 Interactive Engine

Big-O Complexity Growth Playground

Explore asymptotic growth curves and see the dual Time & Space charts LeetGitSyncPro builds for every problem.

Input Size (N): N = 1,000
Hover over chart points to inspect exact operations & memory
Time Complexity: O(N) — Linear Operations Excellent (O(N))
X-Axis: Input Elements (N) Y-Axis: Total Operations
Active Complexity: O(N)
Computed Operations at N: 1,000 ops
Growth Rate: 1.0x (Direct Proportional)
Efficiency Tier: Optimal for Interviews
💡 Real LeetCode Problem Presets
⚡ Real Mermaid Markdown Generated in GitHub README: Auto-rendered by GitHub

        
Ready to Build Your Portfolio?

Get Started in Less Than 60 Seconds

Install the extension, link your GitHub Personal Access Token, and start solving!

Install LeetGitSyncPro ➔