Your numbers
Every solve updates three models: a knowledge-tracing estimate per skill, an Elo rating against problem difficulty, and a memory schedule per problem. This is what they currently say.
Problems solved
0
0% of the bank
Rating
0
Novice
Level
1
Newcomer · 0 XP
Time logged
0h 0m
0 active days
Activity
lessmore
Rating over time
Elo against problem difficulty, updated on every solve.
Solve a few problems to start the curve.
Last 30 days
Problems solved and reviews completed per day.
Not enough history yet.
solved reviewed0 reviews lifetime
Topic mastery, weakest first
Click a row to open the topic and fix it.
Arrays0/35
Strings0/38
Hashing0/10
Sorting0/8
Binary Search0/22
Two Pointers0/11
Sliding Window0/12
Prefix Sum0/10
Matrix0/13
Intervals0/11
Linked List0/24
Stacks & Queues0/23
Trees0/35
Binary Search Tree0/15
Heap / Priority Queue0/15
Graphs0/37
Greedy0/18
Dynamic Programming0/56
Recursion & Backtracking0/22
Tries0/9
Bit Manipulation0/15
Math & Number Theory0/14
Design (LLD)0/22
Advanced0/11
Shape of your skill
Projection
Remaining486
Your pace0.3 per active day
Full bank done ina while
Current streak0 days
Best streak0 days
Difficulty split
Easy0 / 90
Medium0 / 310
Hard0 / 86
Pattern coverage
Sorted by mastery. The pale ones are where an interview will surprise you.
18
Complement Hashing
0/21 solved
18
Two Pointers (opposite ends)
0/34 solved
18
Fast & Slow Pointers
0/9 solved
18
Fixed Sliding Window
0/3 solved
18
Variable Sliding Window
0/11 solved
18
Prefix Sum / Prefix XOR
0/16 solved
18
Kadane / Running Optimum
0/4 solved
18
Classic Binary Search
0/20 solved
18
Binary Search on the Answer
0/13 solved
18
Cyclic Sort
0/7 solved
18
In-place List Reversal
0/7 solved
18
Merge Intervals
0/10 solved
18
Sweep Line / Event Counting
0/5 solved
18
Monotonic Stack
0/25 solved
18
Monotonic Deque
0/3 solved
18
Top K with a Heap
0/20 solved
18
Two Heaps
0/2 solved
18
Subsets / Combinations
0/17 solved
18
Permutations
0/4 solved
18
Grid Backtracking
0/7 solved
18
Tree DFS (divide and combine)
0/27 solved
18
Tree BFS (level order)
0/10 solved
18
BST Ordering
0/15 solved
18
Graph BFS / Shortest Path
0/12 solved
18
Graph DFS / Flood Fill
0/19 solved
18
Topological Sort
0/5 solved
18
Union-Find (DSU)
0/12 solved
18
Dijkstra
0/6 solved
18
Minimum Spanning Tree
0/2 solved
18
1D DP
0/19 solved
18
0/1 Knapsack Family
0/6 solved
18
Unbounded Knapsack
0/6 solved
18
Two Sequence DP
0/10 solved
18
LIS / Patience
0/4 solved
18
Grid DP
0/13 solved
18
Interval DP
0/8 solved
18
Bitmask DP
0/3 solved
18
State Machine DP
0/4 solved
18
Trie
0/11 solved
18
Bit Tricks
0/18 solved
18
String Matching (KMP / Z / Rabin-Karp)
0/7 solved
18
Greedy with Exchange Argument
0/46 solved
18
In-place Matrix Manipulation
0/12 solved
18
Composite Data Structure Design
0/26 solved
18
Divide & Conquer
0/14 solved
18
Quickselect
0/4 solved
18
Number Theory Toolkit
0/20 solved
18
Segment Tree / Fenwick
0/5 solved