You must be logged in to add a new category

Search in :
Search for :

Category Problems Count
1 Dynamic Programming 1065
2 implementation 967
3 math 589
4 Greedy 552
5 DFS & BFS & Dijkstra 499
6 brute force 439
7 data structures 421
8 Codeforces Div. 2 - A Problems 418
9 Codeforces Div. 2 - B Problems 415
10 Codeforces Div. 2 - C Problems 413
11 Codeforces Div. 2 - D Problems 407
12 Codeforces Div. 2 - E Problems 404
13 Binary Search & Ternary Search 307
14 constructive algorithms 286
15 sortings 281
16 graphs 244
17 Number Theory 217
18 Geometry 201
19 combinatorics 192
20 strings 192
21 trees 165
22 Codeforces Div. 1, D 156
23 probabilities 142
24 Segment Tree 137
25 Network Flow 115
26 two pointers 115
27 bitmasks 99
28 dsu 97
29 Matrix Power 84
30 MST,Disjoint sets,SCC 76
31 hashing 70
32 games 67
33 Ad-hoc 59
34 Binary Indexed Tree 57
35 divide and conquer 57
36 Maximum Matching / Vertex Cover on Bipartite Graph 48
37 Codeforces Div. 2 - F Problems 42
38 backtracking 38
39 Non-Classical Dynamic Programming 36
40 Trie 35
41 bfs 33
42 expresison and parsing 32
43 string suffix structures 32
44 Heavy-Light Descomposition 28
45 Suffix Array/Tree 27
46 KMP 27
47 0/1 Knapsack 27
48 Meet in The Middle 26
49 The_scorpion 24
50 FFT 21
51 Balanced Binary Search Trees 21
52 LIS 21
53 polynomial 20
54 ACM-ICPC Dhaka Site Regional Contests 20
55 TopologicalSort 20
56 All Pair Shortest Path (Floyd-Warshall) 18
57 MO?s Algorithm (Query square root decomposition) 16
58 Convex hull 15
59 back-tracking 14
60 Lowest Common Ancestor 14
61 Suffix automaton 14
62 LCA 14
63 EulerianTour 13
64 Codeforces Practice List 13
65 Reasoning 13
66 2sat 12
67 LCS 12
68 Aho-Corasick 12
69 line sweep 11
70 Gaussian elimination 11
71 Strategy 10
72 beginner 10
73 Hungarian Algorithm 9
74 Math Games 9
75 Edit Distance 9
76 STL 9
77 Coin Change 9
78 Complete Searsh 8
79 Articulation Point 8
80 DFS&BFS 7
81 bit manipulation 7
82 segment trees 7
83 MCM & OBST 6
84 Bellman-Ford 6
85 ad hoc 6
86 kth shortest path 5
87 Treap 5
88 Optimization 5
89 SGU Problems 5
90 Centroid Decomposition 5
91 big numbers 5
92 STOP ADDING DUMP CATEGORIES 5
93 RMQ 5
94 Rabin-Karp 5
95 Heaps 5
96 Simulated Annealing 5
97 Game Theory 5
98 Dijkstra 4
99 matrix exponentiation 4
100 AI 4
101 Iniciante 4
102 Partitioning 4
103 tries 4
104 schedules 4
105 Minimum Spanning Tree 4
106 Grid compression 4
107 chinese remainder theorem 4
108 Float precision 3
109 Strongly Connected Components 3
110 Difference Constraints 3
111 Newton Raphson method 3
112 Recursion 3
113 Range tree 3
114 Simulation 3
115 digit dp 3
116 Factoradic Index 2
117 linked list 2
118 Biconnected Component 2
119 dinamyc porograming 2
120 Voronoi 2
121 Alignment 2
122 dp 2
123 Pigeonhole principle 2
124 acm 2
125 Polygon centroid 2
126 Minimum Enclosing Circle 2
127 justSama 2
128 string 2
129 flood fill 2
130 Max points on line 2
131 Algorithm X 2
132 Minkowski addition 2
133 binary search 1
134 uri 1
135 omar 1
136 Coordinate Compression 1
137 Disjoint Set Union 1
138 general 1
139 Stable Marriage 1
140 acm egypt 1
141 Begginer 1
142 bst 1
143 bi connected component 1
144 suffix array 1
145 prime 1
146 dfs 1
147 SRP_HOMEWORK_01 1
148 Minimum cost arborescence 1
149 algorithms 1
150 Linear Programming 1
151 dynammic programming 1
152 Basica 1
153 maximum empty rectangle 1
154 Logic 1
155 Mathematical Questions 1
156 Codeforces 1
157 binary search tree 1
158 Circle sweep 1
159 SRM 557 DivII 250 1
160 MST 1
161 data structure 1
162 kingdon 1
163 disunion set 1
164 Z algorithm 1
165 add hoc 0
166 Dfs and similar 0
167 B 0
168 dynamic programing 0
169 link list 0
170 abed 0
171 Queues 0
172 Codeforces Div. 1, E 0
173 priority queue 0
174 graphe 0
175 shortestpath 0
176 sort 0
177 SPC 0
178 bitmasks problems 0
179 uva 0
180 big mod 0
181 bits 0
182 biney index tree 0
183 Chinese Postman Problem 0
184 garf 0
185 dynamic 0
186 15822 0
187 begainners 0
188 Dynam 0
189 Div 2 0
190 game 0
191 SERCLE DEATH 0
192 Graph Coloring Welsh-Powell Algorithm 0
193 pinary search 0
194 backtrack 0
195 union 0
196 convex 0
197 0/1 0
198 coci 0
199 Junior Training Sheet - template - v4.4 0
200 252 0
201 arab 0
202 customfurnish 0
203 Simple Math 0
204 reursion 0
205 topological sory 0
206 109 0
207 structs 0
208 bridges 0
209 knapsack algorithm 0
210 Combi 0
211 divide 0
212 184. Strings with Same Letters 0
213 c 0
214 longest 0
215 vec 0
216 29708 - ContestPreparation 0
217 graps 0
218 search 0
219 SAMO 0
220 india 0
221 184 0
222 stack 0
223 linked lists 0
224 LP1-I_so_love_programming! 0
225 meet-in-the-middle 0
226 Mother bear uva 0
227 pst0 0
228 Media 0
229 dp bitmask 0
230 training round #2 0
231 gemastik 0
232 mathematical 0
233 sara reda 0
234 max flow 0
235 Theatre Square 0
236 aho 0
237 m 0
238 array 0
239 euclid 0
240 2-sat 0
241 twins 0
242 books 0
243 probability 0
244 BIT 0
245 125. Objects Count 0
246 scc 0
247 maxflow 0
248 Iniciante - Aracode 0
249 sorting 0
250 Ladder 0
251 Sparse Table 0
252 mineira 0
253 codeforces Div2 A 0
254 hbb 0
255 binary tree 0
256 Mo 0
257 Math & Geometry 0
258 Joud Khattab 0
259 Palindromes 0
260 geekhamza 0
261 2A 0
262 30008 0
263 Capital City 0
264 lucas theorem 0
265 bainary search 0
266 caoyu01 0
267 impemention 0
268 1160 0
269 regionals 0
270 range minimum querry 0
271 a canh 0
272 spoj 0
273 Dijkstra dfs bfs 0
274 Topological sort 0
275 div 2C 0
276 codeforce 0
277 stacks 0
278 amman cpc 2015 0
279 codeforces div 1-a 0
280 13 0
281 queue 0
282 graph 0
283 C# 0
284 ciclos 0
285 knapsack 0
286 indonesia 0
287 toplogical sort 0
288 beginners 0
289 ad 0
290 andres 0
291 tarjan 0
292 matching 0
293 implemntation 0
294 Mispelling 0
295 gcd 0
296 bipartite 0
297 ACM Syrian Collegiate Programming Contest 2 0
298 fenwick tree 0
299 22134 - LP1-FPUNA-2015 0
300 Div2 0
301 andrerabelo 0
302 merge sort 0
303 Problem 2 Component Testing 0
304 rabin 0
305 level 1 0
306 Ahmad 0
307 dfs & bfs 0
308 10945 0
309 re 0
310 recursive 0
311 training round 0
312 disjoint set 0
313 28239 0
314 niquefa 0
315 matrices 0
316 bellman 0
317 Div 2 B 0
318 nfa 0
319 Google Code Jam 0
320 adhoc 0
321 1c 0
322 Mid-Central USA 0
323 stable roomate 0
324 fibo 0
325 suffix 0
326 icpc 0
327 matrix multiplication problem 0
328 heavy light decomposition 0
329 flow 0
330 sort drinking 0
331 tree 0
332 ifrn 0
333 depth first search 0
334 a2 0
335 url 0
336 basic programming 0
337 353 0
338 dy 0
339 2791 - Lagrange's Four-Square Theorem 0
340 math geometry 0
341 UFG 0
342 palindrome 0
343 473 0
344 acm phase 0 0
345 binar search 0
346 acam 0
347 extended 0
348 factoradic 0
349 A 0
350 obi 0
351 zu 0
352 classes 0
353 disjoint 0
354 knj 0
355 biginteger 0
356 oc 0
357 zbox 0
358 two pointerd 0
359 ahmeddahi92 0
360 jzzhu and sequences 0
361 Graph basics concepts BFS & DFS 0
362 crazy search 0
363 ad hock 0
364 Bfs Dfs 0
365 contest 0
366 data 0
367 matrix 0
368 195 0
369 PI-UFS-T01 0
370 bitmask 0
371 graph theory 0
372 Add them twice 0
373 UNCC ACM 0
374 function 0
375 warshall 0
376 implmentation 0
377 two pointer 0
378 ECPC 0
379 hash 0
380 breadth first search 0
381 easy 0
382 Avanzada 0
383 binary 0
384 bitmask problems 0
385 hakenbush 0
386 1119 0
387 ECPC 2014 0
388 game thery 0
389 breath first search 0
390 segment 0
391 floyd warshall 0
392 Treinamento1604 0
393 topological 0
394 Disjoint Sets 0
395 dd 0
396 Pattern 0
397 Practice 0
398 maths 0
399 Dinamic 0
400 352-Pesky Palindromes 0
401 North America - Mid-Central USA 0
402 codeforces Div 1 A 0