Skills
Mastery comes from what you actually wrote, debugged and recalled cold. Recognising something is never enough to look fluent.
- Practiced
- 0 of 108
- Competent or better
- 0
- Needs reps
- 0
108 of 108 skills
Python foundations0/15
- list literal—UnseenNo reps yet
- list indexing—UnseenNo reps yet
- list.append—UnseenNo reps yet
- len()—UnseenNo reps yet
- for loop—UnseenNo reps yet
- list iteration—UnseenNo reps yet
- range()—UnseenNo reps yet
- enumerate—UnseenNo reps yet
- if / elif / else—UnseenNo reps yet
- accumulator variable—UnseenNo reps yet
- early return—UnseenNo reps yet
- functions—UnseenNo reps yet
- while loop—UnseenNo reps yet
- tuples & unpacking—UnseenNo reps yet
- list comprehension—UnseenNo reps yet
Hashing0/16
- set creation—UnseenNo reps yet
- set.add—UnseenNo reps yet
- set membership—UnseenNo reps yet
- dict creation—UnseenNo reps yet
- dict assignment—UnseenNo reps yet
- dict lookup—UnseenNo reps yet
- dict membership—UnseenNo reps yet
- dict.get—UnseenNo reps yet
- iterating dicts—UnseenNo reps yet
- frequency map—UnseenNo reps yet
- index map—UnseenNo reps yet
- complement arithmetic—UnseenNo reps yet
- hash map reasoning—UnseenNo reps yet
- grouping by a key—UnseenNo reps yet
- run starts—UnseenNo reps yet
- prefix & suffix passes—UnseenNo reps yet
Strings & pointers0/10
- string indexing—UnseenNo reps yet
- string iteration—UnseenNo reps yet
- string methods—UnseenNo reps yet
- slicing—UnseenNo reps yet
- two pointers—UnseenNo reps yet
- pointer updates—UnseenNo reps yet
- running state—UnseenNo reps yet
- length-prefixed strings—UnseenNo reps yet
- skipping duplicates—UnseenNo reps yet
- expand around a center—UnseenNo reps yet
Windows & stacks0/5
Search & linked lists0/9
- binary search—UnseenNo reps yet
- mid calculation—UnseenNo reps yet
- search invariant—UnseenNo reps yet
- rotated-array search—UnseenNo reps yet
- ListNode—UnseenNo reps yet
- linked list traversal—UnseenNo reps yet
- pointer reassignment—UnseenNo reps yet
- dummy head—UnseenNo reps yet
- fast & slow pointers—UnseenNo reps yet
Recursion & trees0/11
- base case—UnseenNo reps yet
- recursive return—UnseenNo reps yet
- TreeNode—UnseenNo reps yet
- tree DFS—UnseenNo reps yet
- BST ordering—UnseenNo reps yet
- in-order traversal—UnseenNo reps yet
- building a tree from traversals—UnseenNo reps yet
- return one thing, record another—UnseenNo reps yet
- trie node & insert—UnseenNo reps yet
- trie search & prefixes—UnseenNo reps yet
- trie search with a wildcard—UnseenNo reps yet
BFS & grids0/10
- collections.deque—UnseenNo reps yet
- BFS—UnseenNo reps yet
- BFS by level—UnseenNo reps yet
- nested lists / grids—UnseenNo reps yet
- neighbors & bounds—UnseenNo reps yet
- visited set—UnseenNo reps yet
- reaching inward from the borders—UnseenNo reps yet
- transpose & reverse in place—UnseenNo reps yet
- walking the boundaries—UnseenNo reps yet
- mark first, change after—UnseenNo reps yet
Graphs0/7
Heaps, sorting & intervals0/8
Backtracking & DP0/14
- backtracking state—UnseenNo reps yet
- memoization—UnseenNo reps yet
- recurrence reasoning—UnseenNo reps yet
- bottom-up DP—UnseenNo reps yet
- start index & reuse—UnseenNo reps yet
- mark, explore, unmark on a grid—UnseenNo reps yet
- best ending here—UnseenNo reps yet
- farthest reach—UnseenNo reps yet
- a circle as two lines—UnseenNo reps yet
- min over choices—UnseenNo reps yet
- looking back at every earlier index—UnseenNo reps yet
- DP over string prefixes—UnseenNo reps yet
- 2-D DP table—UnseenNo reps yet
- DP over two sequences—UnseenNo reps yet