reps.gg/taxonomy.yaml at main · KushaalP/reps.gg · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
topics:
  - name: Arrays & Hashing
    importance: 0.95
    subtopics:
      - name: Frequency Counting / Hash Map Lookup
        importance: 0.95
      - name: Prefix Sums
        importance: 0.90
      - name: Kadane's Algorithm (Max Subarray)
        importance: 0.70
      - name: Sorting + Comparison
        importance: 0.75
      - name: Complement Search (Two Sum Pattern)
        importance: 0.85
      - name: Matrix Traversal (Diagonal, Valid Sudoku, etc)
        importance: 0.60

  - name: Two Pointers
    importance: 0.90
    subtopics:
      - name: Opposite-Direction (Converging)
        importance: 0.90
      - name: Same-Direction (Fast/Slow on Arrays)
        importance: 0.75
      - name: K-Sum Pattern (3Sum, 4Sum)
        importance: 0.70

  - name: Stack
    importance: 0.80
    subtopics:
      - name: Monotonic Stack
        importance: 0.80
      - name: Stack-Based Simulation
        importance: 0.80

  - name: Binary Search
    importance: 0.90
    subtopics:
      - name: Standard Binary Search
        importance: 0.95
      - name: Binary Search on Answer Space
        importance: 0.85
      - name: Boundary Finding (Bisect Left/Right)
        importance: 0.85
      - name: Search in Rotated/Modified Array
        importance: 0.70

  - name: Sliding Window
    importance: 0.875
    subtopics:
      - name: Fixed-Size Window
        importance: 0.80
      - name: Variable-Size Window (Expand/Contract)
        importance: 0.90
      - name: Window with Monotonic Deque
        importance: 0.55

  - name: Linked List
    importance: 0.70
    subtopics:
      - name: Fast/Slow Pointers (Cycle, Middle)
        importance: 0.75
      - name: Reversal (Full and Partial)
        importance: 0.80
      - name: Merge Linked Lists
        importance: 0.65

  - name: Trees
    importance: 0.90
    subtopics:
      - name: DFS Traversal (Inorder, Preorder, Postorder)
        importance: 0.95
      - name: BFS / Level-Order Traversal
        importance: 0.90
      - name: BST Operations (Insert, Delete, Validate)
        importance: 0.80
      - name: Lowest Common Ancestor
        importance: 0.65
      - name: Path Sum Problems
        importance: 0.65

  - name: Tries
    importance: 0.50
    subtopics:
      - name: Trie Construction / Prefix Search
        importance: 0.60

  - name: Backtracking
    importance: 0.80
    subtopics:
      - name: Permutations
        importance: 0.85
      - name: Combinations / Subsets
        importance: 0.90
      - name: Constraint Satisfaction (N-Queens)
        importance: 0.70
      - name: String Partitioning (Palindrome Partitioning)
        importance: 0.65
      - name: Path Finding with Backtracking
        importance: 0.55

  - name: Heap / Priority Queue
    importance: 0.80
    subtopics:
      - name: Top-K Elements
        importance: 0.85
      - name: Merge K Sorted Structures
        importance: 0.50
      - name: Heap Simulation
        importance: 0.75

  - name: Graphs
    importance: 0.90
    subtopics:
      - name: BFS Shortest Path (Unweighted)
        importance: 0.90
      - name: Multi-Source BFS
        importance: 0.75
      - name: DFS Connected Components
        importance: 0.80
      - name: DFS Path Finding
        importance: 0.65
      - name: Union-Find
        importance: 0.65
      - name: Topological Sort
        importance: 0.80

  - name: Core DP
    importance: 0.85
    subtopics:
      - name: Linear Recurrence DP
        importance: 0.90
      - name: Longest Increasing Subsequence
        importance: 0.75
      - name: Word Break / String DP
        importance: 0.75
      - name: Unbounded Knapsack
        importance: 0.80
      - name: 0/1 Knapsack
        importance: 0.80
      - name: Two Sequence DP (LCS, Edit distance)
        importance: 0.75
      - name: Grid Path Problems
        importance: 0.75

  - name: Intervals
    importance: 0.70
    subtopics:
      - name: Interval Merging
        importance: 0.80
      - name: Sweep Line / Meeting Rooms
        importance: 0.75

  - name: Greedy
    importance: 0.75
    subtopics:
      - name: General Greedy (Greedy is main insight)
        importance: 0.75

  - name: Advanced Graphs
    importance: 0.50
    subtopics:
      - name: Dijkstra's (Weighted Shortest Path)
        importance: 0.75
      - name: Minimum Spanning Tree (Prim's / Kruskal's)
        importance: 0.50

  - name: Advanced DP
    importance: 0.40
    subtopics:
      - name: Bitmask DP
        importance: 0.40
      - name: Interval DP
        importance: 0.40

  - name: Bit Manipulation
    importance: 0.45
    subtopics:
      - name: General Bit Manipulation
        importance: 0.50

  - name: Math & Geometry
    importance: 0.40
    subtopics:
      - name: General Math
        importance: 0.45
      - name: Modular Arithmetic
        importance: 0.55
      - name: GCD / LCM
        importance: 0.50
      - name: Primes / Sieve of Eratosthenes
        importance: 0.35
      - name: Combinatorics
        importance: 0.45