Every problem you've solved.
One search away.
AlgoKeep is the notebook for your DSA brain — store solutions with code, tag them by topic and difficulty, then find any pattern you've ever written in a keystroke.
- Next.js 16
- App Router + RSC
- Dockerized
- Two services, one command
- CI/CD
- Push to master → live on EC2
Longest Substring Without Repeat
def lengthOfLongest(s): seen, left, best = {}, 0, 0 for r, ch in enumerate(s): if ch in seen: left = max(left, seen[ch]+1)
Binary Search on Rotated Array
int search(vector<int>& a, int t) { int lo = 0, hi = a.size()-1; while (lo <= hi) { int mid = lo + (hi-lo)/2;
Course Schedule (Cycle Detect)
// Kahn — topological sort const canFinish = (numCourses, pre) => { const indeg = new Array(numCourses).fill(0);
Coin Change — Min Coins
int coinChange(int[] coins, int amt) { int[] dp = new int[amt+1]; Arrays.fill(dp, amt+1);
Built for the way you actually revise
Not another note app with a code block. Every field exists because it's what you need when you re-open a problem six months later.
Save the solution, not just the link
Title, language, topic, difficulty and the code itself — captured in one pass so the note is still useful long after you've forgotten the problem.
def twoSum(nums, target): seen = {} for i, v in enumerate(nums): if target - v in seen: return [seen[target - v], i] seen[v] = i
Find it in a keystroke
Search across titles and stack filters on top — language, difficulty, topic — to narrow a large library down to the handful you care about.
Organize by topic and difficulty
Group solutions by pattern — sliding window, DP, graphs — and filter down to exactly the set you want to review.
Favourite the ones that matter
Flag the problems you keep forgetting and pull them up as a focused revision list.
Available on every device
Your library lives on the server, not a laptop — open it from anywhere before an interview.
Dense where it counts, quiet everywhere else
One screen holds your whole library — filters on top, topics on the left, code on the cards.
Longest Substring Without Repeat
def lengthOfLongest(s): seen, left, best = {}, 0, 0 for r, ch in enumerate(s): if ch in seen: left = max(left, seen[ch]+1)
Binary Search on Rotated Array
int search(vector<int>& a, int t) { int lo = 0, hi = a.size()-1; while (lo <= hi) { int mid = lo + (hi-lo)/2;
Course Schedule (Cycle Detect)
// Kahn — topological sort const canFinish = (numCourses, pre) => { const indeg = new Array(numCourses).fill(0);
Coin Change — Min Coins
int coinChange(int[] coins, int amt) { int[] dp = new int[amt+1]; Arrays.fill(dp, amt+1);
Topic sidebar with live counts
Jump straight to a pattern and see how much coverage you have on it.
Stackable filters
Combine search, difficulty and language — the result set narrows instantly.
Code visible on the card
Recognise a solution from the grid without opening anything.
Not a tutorial project.
Shipped like production.
Owned end to end — from the Redux selector layer to the TLS certificate on the box serving it.
Zero-touch continuous deployment
No SSH, no manual builds. Merge and it's live.
# .github/workflows/deploy.yml run: docker compose pull && docker compose up -d
Auth that scopes every query
bcrypt-hashed passwords, JWTs with a 7-day expiry, and middleware that pins every read to req.user — so one user can never read another's notes.
Filtering that doesn't re-render
Derived state runs through memoized Reselect selectors, so filtering a large library recomputes only when its inputs actually change.
createSelector( [selectNotes, selectFilters], filterNotes )
Separate dev and prod containers
Hot-reload locally; immutable, pinned images in production.
- — Mounted volumes, live reload
- — Mongo exposed for inspection
- — No volumes, versioned tags
- — Behind Nginx reverse proxy
Stop re-solving problems you've already solved
Create an account and start your library with the problem you solved today.
Free · No credit card · Your notes stay yours