AlgoLedger
Scroll
1 commit= 1 accepted submission
Zero backendGitHub is the database
100% yoursa plain git repo, forever
01Clone & load the extension
02Connect your GitHub
03Solve on LeetCode
04Watch it land
zsh — Terminal

$

chrome-extension://algoledger/onboarding.html
AlgoLedger Setup
Step 1 of 4
1Connect GitHub
2Choose repository
3Confirm & connect
4Done

Connect GitHub

Paste a fine-grained personal access token with repo scope.

ghp_••••••••••••••••••••
leetcode.com/problems/two-sum
0Premium

1. Two Sum

EasyTopicsCompaniesHint

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

You can return the answer in any order.

Example 1:

Input: nums = [2,7,11,15], target = 9

Output: [0,1]

Example 2:

Input: nums = [3,2,4], target = 6

Output: [1,2]

Example 3:

Input: nums = [3,3], target = 6

Output: [0,1]

Constraints:

  • 2 ≤ nums.length ≤ 10⁴
  • -10⁹ ≤ nums[i] ≤ 10⁹
  • Only one valid answer exists.
69.3K2K
2685 Online
Python3|Auto
1
2
3
4
5
6
7
8
9
10
11
12
# from typing import List
class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
seen = {}
for idx, val in enumerate(nums):
complement = target - val
if complement in seen:
return [seen[complement], idx]
seen[val] = idx
return []
SavedLn 1, Col 1

Input

nums =

[2,7,11,15]

github.com/3ncryptor/AlgoLedger
feat(leetcode): solve 0001-two-sumjust now
/
1 commit · 3 files changed

Why AlgoLedger

Built like a real engineering artifact

GitHub-native

No backend, no third-party database — your repository is the whole system.

Structured commits

One commit per accepted submission — real git history of your growth.

Multi-way indexing

Browse by problem number, difficulty, topic, or language — automatically.

Activity intelligence

A contribution heatmap and topic radar, generated from your own history.

Zero manual work

Solve the problem. AlgoLedger captures and commits it in the background.

Own your data

It's a plain git repository — exportable, greppable, forkable, forever.

Build in Public

Come read the code. Come change it.

AlgoLedger is a pnpm/Turborepo monorepo, fully typed, built on the principle that GitHub is the database — no hidden backend to reverse-engineer. Every part of the pipeline, from capture to commit, is right here for you to read.

TypeScriptpnpm workspacesTurborepoManifest V3Next.jsZod
Star & contributeBrowse open issues

Add a platform adapter

Extend capture beyond LeetCode — Codeforces and HackerRank are already stubbed.

Good first issue

Improve the popup UI

Polish the dashboard, the knowledge graph, or the onboarding flow.

Good first issue

Write more tests

Strengthen coverage across generators, adapters, and the sync engine.

Good first issue

Real product, not a mockup

Your repository, browsable

leetcode/README.md

0001Two SumEasy
00153SumMedium
0146LRU CacheHard
0200Number of IslandsMedium
Array (24)Hash Table (18)Dynamic Programming (11)Graph (9)

Contribution heatmap

Positioning

This isn't another tracker

Most LeetHub-style tools just dump your code into a repo. AlgoLedger builds a structured, categorized knowledge base out of it.

Generic code-dump tools

Just pushes raw source files
One flat folder, no organization
No activity insight
Manual copy-paste after every solve

AlgoLedger

Generates README + metadata + solution
Multi-way index: topic, difficulty, language
Contribution heatmap + topic radar built in
Fully automatic, silent capture

Start archiving today

Two minutes to connect. Every solve after that is automatic.

Clone & load the extensionStar & contribute