Eight ranks. You reach one by closing whole topics, not by collecting points.
- 1Newcomer
The path is open. Prove your first step.
Steps in total: 0
- 2Apprentice
The basics are behind you.
Steps in total: 9
Foundations (start here) - 3Practitioner
You read complexity and pick the right collection.
Steps in total: 19
Big-O & arraysCollections & hash tables - 4Engineer
Pointers, windows, prefixes and binary search are yours.
Steps in total: 33
Two pointers & windowsPrefix & differenceSearching - 5Specialist
Sorting, lists, stacks and queues no longer surprise you.
Steps in total: 57
Sorting & intervalsLinked listsStacks & queues - 6Expert
Recursion and trees are ordinary work now.
Steps in total: 80
Recursion & backtrackingTrees - 7Master
Heaps, graphs and greedy choices.
Steps in total: 111
Heaps & top-kGraphsGreedy - 8Architect
The whole track is proven.
Steps in total: 150
Dynamic programmingStrings & trieBit tricks & mathMatrix & gridsAdvanced
How a rank is earned
A topic closes when every step in it is proven, in your own code, against its own tests. Half a topic earns nothing. A rank you reach stays yours, even if its requirements get stricter later.
Create a free account to start climbing.