You must be logged in to add a new category

Search in :
Search for :

Category Problems Count
1 Dynamic Programming 1154
2 implementation 1044
3 math 655
4 Greedy 591
5 DFS & BFS & Dijkstra 556
6 brute force 492
7 data structures 485
8 Codeforces Div. 2 - A Problems 459
9 Codeforces Div. 2 - C Problems 455
10 Codeforces Div. 2 - B Problems 448
11 Codeforces Div. 2 - D Problems 439
12 Codeforces Div. 2 - E Problems 433
13 Best Problem Setters 402
14 Binary Search & Ternary Search 342
15 constructive algorithms 330
16 sortings 312
17 graphs 280
18 Number Theory 243
19 Geometry 223
20 combinatorics 215
21 strings 210
22 trees 196
23 Network Flow 157
24 Codeforces Div. 1, D 157
25 Segment Tree 154
26 probabilities 149
27 two pointers 128
28 bitmasks 112
29 dsu 109
30 Matrix Power 90
31 Top Coder 84
32 #Errichto 78
33 games 77
34 MST,Disjoint sets,SCC 76
35 hashing 74
36 divide and conquer 66
37 Binary Indexed Tree 64
38 Ad-hoc 59
39 CUET 55
40 Codeforces Div. 2 - F Problems 52
41 Maximum Matching / Vertex Cover on Bipartite Graph 50
42 backtracking 40
43 Trie 38
44 Non-Classical Dynamic Programming 36
45 bfs 35
46 string suffix structures 34
47 expresison and parsing 33
48 Heavy-Light Descomposition 33
49 KMP 28
50 Meet in The Middle 28
51 0/1 Knapsack 27
52 Suffix Array/Tree 27
53 Balanced Binary Search Trees 26
54 The_scorpion 24
55 MO?s Algorithm (Query square root decomposition) 24
56 FFT 23
57 LIS 21
58 TopologicalSort 21
59 ACM-ICPC Dhaka Site Regional Contests 20
60 polynomial 20
61 All Pair Shortest Path (Floyd-Warshall) 18
62 LCA 16
63 Convex hull 16
64 Strongly Connected Components 15
65 EulerianTour 15
66 Aho-Corasick 15
67 Centroid Decomposition 14
68 Suffix automaton 14
69 back-tracking 14
70 Lowest Common Ancestor 14
71 Codeforces Practice List 13
72 Reasoning 13
73 LCS 13
74 line sweep 13
75 Hungarian Algorithm 13
76 2sat 12
77 Gaussian elimination 11
78 Coin Change 10
79 beginner 10
80 Strategy 10
81 Edit Distance 9
82 STL 9
83 Math Games 9
84 Articulation Point 8
85 Heaps 8
86 istasis likes dhinchak pooja 8
87 DFS&BFS 8
88 Complete Searsh 8
89 bit manipulation 7
90 Persistent Segment Tree 7
91 ad hoc 7
92 Simulated Annealing 7
93 Mobius Function 7
94 segment trees 7
95 Dijkstra 7
96 STOP ADDING DUMP CATEGORIES 6
97 Simulation 6
98 digit dp 6
99 chinese remainder theorem 6
100 Square Root Decomposition 6
101 MCM & OBST 6
102 Randomized Algorithm 6
103 0/1 BFS 6
104 Bellman-Ford 6
105 big numbers 5
106 Recursion 5
107 RMQ 5
108 Rabin-Karp 5
109 Minimum Spanning Tree 5
110 Game Theory 5
111 kth shortest path 5
112 Minimum Cost Flow 5
113 2D Range Queries 5
114 Treap 5
115 Optimization 5
116 SGU Problems 5
117 AI 4
118 Iniciante 4
119 Partitioning 4
120 tries 4
121 schedules 4
122 Grid compression 4
123 Kadane's Algorithm 4
124 matrix exponentiation 4
125 Newton Raphson method 3
126 Range tree 3
127 Minkowski addition 3
128 flood fill 3
129 Z algorithm 3
130 Float precision 3
131 linked list 3
132 Prefix Sums 3
133 Difference Constraints 3
134 ista breaks up with shreya 2
135 Polygon centroid 2
136 Minimum Enclosing Circle 2
137 frequency ARRAY 2
138 big mod 2
139 binar search 2
140 justSama 2
141 string 2
142 SRM 557 DivII 250 2
143 Max points on line 2
144 Algorithm X 2
145 Factoradic Index 2
146 binary search 2
147 Biconnected Component 2
148 dinamyc porograming 2
149 Alignment 2
150 Voronoi 2
151 dp 2
152 SQRT Heuristic 2
153 Pigeonhole principle 2
154 acm 2
155 dfs 2
156 Minimum cost arborescence 1
157 algorithms 1
158 Linear Programming 1
159 dynammic programming 1
160 Basica 1
161 MST 1
162 topological 1
163 kingdon 1
164 maximum empty rectangle 1
165 Logic 1
166 Mathematical Questions 1
167 Queues 1
168 binary search tree 1
169 Codeforces 1
170 begainners 1
171 Graph basics concepts BFS & DFS 1
172 contest 1
173 Coordinate Compression 1
174 ista = LGBT head 1
175 Circle sweep 1
176 Disjoint Set Union 1
177 ECPC 2014 1
178 data structure 1
179 acm egypt 1
180 disunion set 1
181 uva 1
182 Dynam 1
183 uri 1
184 omar 1
185 109 1
186 SRP_HOMEWORK_01 1
187 ciclos 1
188 Arrays 1
189 Stable Marriage 1
190 Begginer 1
191 general 1
192 scc 1
193 bst 1
194 suffix array 1
195 bi connected component 1
196 prime 1
197 data 0
198 crggamers 0
199 toplogical sort 0
200 implemntation 0
201 Mispelling 0
202 gcd 0
203 bs 0
204 Bfs Dfs 0
205 the life 0
206 andres 0
207 UNCC ACM 0
208 22134 - LP1-FPUNA-2015 0
209 matching 0
210 dynamic programming,codeforces DIV 2 D 0
211 andrerabelo 0
212 merge sort 0
213 maps 0
214 Add them twice 0
215 permutatiin 0
216 ACM Syrian Collegiate Programming Contest 2 0
217 hash 0
218 koki 0
219 10945 0
220 Div2 0
221 ternary 0
222 recursive 0
223 square 0
224 Problem 2 Component Testing 0
225 rabin 0
226 two pointer 0
227 . Translation 0
228 Ahmad 0
229 disjoint ser 0
230 re 0
231 Div 2 B 0
232 d 0
233 frequency arrays 0
234 training round 0
235 disjoint set 0
236 hakenbush 0
237 Codeforces Div.1 - A problems 0
238 niquefa 0
239 bina 0
240 Mid-Central USA 0
241 bellman 0
242 fibo 0
243 djikstra 0
244 suffix 0
245 A - Siggy?s sum 0
246 nfa 0
247 binary sarch 0
248 adhoc 0
249 codefoces 0
250 flow 0
251 codeforces Div 1 A 0
252 tree 0
253 floyd 0
254 depth first search 0
255 icpc 0
256 Dinamic 0
257 AVL 0
258 link list 0
259 adoc 0
260 dy 0
261 web 0
262 math geometry 0
263 bitmasking 0
264 B 0
265 articulation 0
266 url 0
267 bitmasks problems 0
268 thenoobestever 0
269 accum 0
270 acm phase 0 0
271 2791 - Lagrange's Four-Square Theorem 0
272 acam 0
273 vector 0
274 UFG 0
275 sort 0
276 union find 0
277 A 0
278 Div 2 0
279 palan 0
280 zu 0
281 disjoint 0
282 div 0
283 knj 0
284 extended 0
285 decode 0
286 factoradic 0
287 zbox 0
288 0/1 0
289 recurrsion 0
290 ahmeddahi92 0
291 classes 0
292 comb 0
293 crazy search 0
294 biginteger 0
295 greedy problem 0
296 union 0
297 reursion 0
298 ternary search 0
299 jzzhu and sequences 0
300 195 0
301 flo 0
302 PI-UFS-T01 0
303 bitmask 0
304 priority 0
305 ad hock 0
306 Simple Math 0
307 bin 0
308 dynaamic 0
309 matrix 0
310 warshall 0
311 implmentation 0
312 kruskal 0
313 graph theory 0
314 bridges 0
315 abdalrahmanatwah 0
316 29708 - ContestPreparation 0
317 JCPC 0
318 function 0
319 easy 0
320 LCIS 0
321 Avanzada 0
322 binary 0
323 kmp algo 0
324 longest 0
325 Div.2-C 0
326 ECPC 0
327 dilworth 0
328 breadth first search 0
329 breath first search 0
330 set 0
331 segment 0
332 cumulative 0
333 bitmask problems 0
334 LP1-I_so_love_programming! 0
335 Bitmanipulation 0
336 1119 0
337 max flow 0
338 game thery 0
339 dd 0
340 Pattern 0
341 Practice 0
342 topcoder 0
343 floyd warshall 0
344 mathematical 0
345 basic 0
346 Treinamento1604 0
347 books 0
348 codeforces DIv.2A 0
349 North America - Mid-Central USA 0
350 acm sham 0
351 link 0
352 maths 0
353 2-sat 0
354 brute 0
355 352-Pesky Palindromes 0
356 sorting 0
357 abed 0
358 Ladder 0
359 Codeforces Div. 1, E 0
360 codeforce A 0
361 graphe 0
362 rolling hash 0
363 add hoc 0
364 Dfs and similar 0
365 maxflow 0
366 ACM Arab Collegiate Programming Contest 2013 0
367 dynamic programing 0
368 codeforces Div2 A 0
369 segmentation tree 0
370 binary tree 0
371 bits 0
372 ifrn 0
373 Chinese Postman Problem 0
374 garf 0
375 Mriganga 0
376 shortestpath 0
377 adhocv 0
378 SPC 0
379 geekhamza 0
380 recrence 0
381 30008 0
382 multiset 0
383 game 0
384 biney index tree 0
385 Graph Coloring Welsh-Powell Algorithm 0
386 Gammal 0
387 dynamic 0
388 Palindromes 0
389 sweep line 0
390 15822 0
391 trre 0
392 convex 0
393 a canh 0
394 backtacking 0
395 coci 0
396 SERCLE DEATH 0
397 252 0
398 D-Codeforces 0
399 arab 0
400 pinary search 0
401 backtrack 0
402 regionals 0
403 codeforces div 1-a 0
404 digit 0
405 Junior Training Sheet - template - v4.4 0
406 Sheet: https://a2oj.com/register?ID=32538 0
407 structs 0
408 customfurnish 0
409 bit masking 0
410 stacks 0
411 Codeforces Div. 1 - A Problems 0
412 knapsack algorithm 0
413 topological sory 0
414 divide 0
415 combination 0
416 184. Strings with Same Letters 0
417 number system 0
418 shop 0
419 tarjan 0
420 counting 0
421 graps 0
422 Combi 0
423 SAMO 0
424 india 0
425 184 0
426 Groups 0
427 c 0
428 ad 0
429 permutation 0
430 vec 0
431 fenwick tree 0
432 dijstrika 0
433 Mother bear uva 0
434 search 0
435 Acm world final 2011 0
436 Media 0
437 dp bitmask 0
438 pattern search 0
439 stack 0
440 linked lists 0
441 bipartite 0
442 Translation 0
443 meet-in-the-middle 0
444 dfs & bfs 0
445 Theatre Square 0
446 pst0 0
447 m 0
448 array 0
449 frequency 0
450 training round #2 0
451 gemastik 0
452 level 1 0
453 level 2 0
454 sara reda 0
455 matrices 0
456 geomtry 0
457 probability 0
458 aho 0
459 BIT 0
460 arraya 0
461 power 0
462 euclid 0
463 28239 0
464 dpinto 0
465 twins 0
466 1c 0
467 stable roomate 0
468 Sparse Table 0
469 centroid 0
470 bipartite matching 0
471 125. Objects Count 0
472 Google Code Jam 0
473 Iniciante - Aracode 0
474 heavy light decomposition 0
475 hbb 0
476 sort drinking 0
477 Math & Geometry 0
478 binary searsh 0
479 matrix multiplication problem 0
480 so easy 0
481 mineira 0
482 basic programming 0
483 begineer 0
484 2A 0
485 353 0
486 Capital City 0
487 priority queue 0
488 bainary search 0
489 binry 0
490 Joud Khattab 0
491 a2 0
492 number 0
493 disjoint union 0
494 range minimum querry 0
495 473 0
496 159 0
497 spoj 0
498 lucas theorem 0
499 Topological sort 0
500 caoyu01 0
501 impemention 0
502 DIV 2 A 0
503 1160 0
504 palindrome 0
505 Consecutive Ranges 0
506 amman cpc 2015 0
507 obi 0
508 Contest Hall Preparation 0
509 Dijkstra dfs bfs 0
510 queue 0
511 cummulative 0
512 graph 0
513 div 2C 0
514 codeforce div1 catagori A 0
515 codeforce 0
516 two pointerd 0
517 manel maatouk 0
518 indonesia 0
519 13 0
520 beginners 0
521 heap 0
522 C# 0
523 A2OJ FCI-CU 0
524 oc 0
525 Algo 0
526 knapsack 0