You must be logged in to add a new category

Search in :
Search for :

Category Problems Count
1 Dynamic Programming 1193
2 implementation 1051
3 math 675
4 Greedy 596
5 DFS & BFS & Dijkstra 562
6 brute force 493
7 data structures 488
8 Codeforces Div. 2 - A Problems 469
9 Codeforces Div. 2 - C Problems 459
10 Codeforces Div. 2 - B Problems 453
11 Codeforces Div. 2 - D Problems 443
12 Codeforces Div. 2 - E Problems 437
13 Best Problem Setters 410
14 Binary Search & Ternary Search 347
15 constructive algorithms 331
16 sortings 316
17 graphs 288
18 Number Theory 247
19 Geometry 232
20 combinatorics 215
21 strings 215
22 Codeforces Div. 1, D 209
23 trees 201
24 Segment Tree 162
25 Network Flow 159
26 probabilities 151
27 two pointers 128
28 Codeforces Div. 2 - F Problems 119
29 dsu 116
30 bitmasks 112
31 Problem list 100
32 Matrix Power 90
33 Top Coder 84
34 #Errichto 78
35 MST,Disjoint sets,SCC 77
36 games 77
37 hashing 75
38 Binary Indexed Tree 68
39 divide and conquer 66
40 Ad-hoc 62
41 CUET 56
42 Maximum Matching / Vertex Cover on Bipartite Graph 50
43 backtracking 42
44 Trie 41
45 bfs 37
46 Heavy-Light Descomposition 36
47 Non-Classical Dynamic Programming 36
48 string suffix structures 34
49 expresison and parsing 33
50 Meet in The Middle 29
51 KMP 28
52 0/1 Knapsack 27
53 Suffix Array/Tree 27
54 Balanced Binary Search Trees 26
55 The_scorpion 24
56 MO?s Algorithm (Query square root decomposition) 24
57 FFT 23
58 Convex hull 22
59 LIS 21
60 TopologicalSort 21
61 2sat 21
62 ACM-ICPC Dhaka Site Regional Contests 20
63 polynomial 20
64 All Pair Shortest Path (Floyd-Warshall) 18
65 LCS 17
66 Aho-Corasick 16
67 LCA 16
68 Codeforces Practice List 15
69 Strongly Connected Components 15
70 EulerianTour 15
71 Centroid Decomposition 14
72 Suffix automaton 14
73 Lowest Common Ancestor 14
74 back-tracking 14
75 interactive 14
76 Reasoning 13
77 line sweep 13
78 Hungarian Algorithm 13
79 Gaussian elimination 11
80 Coin Change 10
81 beginner 10
82 Strategy 10
83 Mobius Function 9
84 Edit Distance 9
85 STL 9
86 ad hoc 9
87 TowerOfHanoi 9
88 Persistent Segment Tree 9
89 Numerical_Integration 9
90 DFS&BFS 9
91 Math Games 9
92 Sqrt decomposition 9
93 istasis likes dhinchak pooja 8
94 Articulation Point 8
95 bit manipulation 8
96 Heaps 8
97 Dijkstra 8
98 Complete Searsh 8
99 Simulated Annealing 7
100 segment trees 7
101 MCM & OBST 7
102 Bellman-Ford 6
103 BinarySearchVariants 6
104 big numbers 6
105 STOP ADDING DUMP CATEGORIES 6
106 0/1 BFS 6
107 RMQ 6
108 Randomized Algorithm 6
109 Simulation 6
110 digit dp 6
111 chinese remainder theorem 6
112 Square Root Decomposition 6
113 Minimum Cost Flow 5
114 Recursion 5
115 Rabin-Karp 5
116 ETF 5
117 Minimum Spanning Tree 5
118 Game Theory 5
119 kth shortest path 5
120 Treap 5
121 matrix exponentiation 5
122 Optimization 5
123 SGU Problems 5
124 2D Range Queries 5
125 AI 4
126 Iniciante 4
127 Partitioning 4
128 Graph basics concepts BFS & DFS 4
129 tries 4
130 schedules 4
131 Grid compression 4
132 Kadane's Algorithm 4
133 Difference Constraints 3
134 Newton Raphson method 3
135 Range tree 3
136 flood fill 3
137 Minkowski addition 3
138 Prefix Sums 3
139 Z algorithm 3
140 Float precision 3
141 linked list 3
142 dinamyc porograming 3
143 acm 2
144 dfs 2
145 Polygon centroid 2
146 Linear Programming 2
147 SQRT Heuristic 2
148 Minimum Enclosing Circle 2
149 justSama 2
150 ista breaks up with shreya 2
151 string 2
152 MST 2
153 SRM 557 DivII 250 2
154 frequency ARRAY 2
155 Max points on line 2
156 big mod 2
157 Algorithm X 2
158 MYTE 2
159 binar search 2
160 Factoradic Index 2
161 binary search 2
162 Biconnected Component 2
163 maxflow 2
164 Alignment 2
165 Voronoi 2
166 dp 2
167 bst 2
168 Pigeonhole principle 2
169 prime 1
170 fenwick tree 1
171 gcd 1
172 Arrays 1
173 algorithms 1
174 Minimum cost arborescence 1
175 dynammic programming 1
176 Basica 1
177 matrix multiplication problem 1
178 Logic 1
179 FST Test 1
180 maximum empty rectangle 1
181 Mathematical Questions 1
182 Codeforces 1
183 binary search tree 1
184 contest 1
185 square 1
186 Circle sweep 1
187 kingdon 1
188 topological 1
189 data structure 1
190 ECPC 2014 1
191 Queues 1
192 disunion set 1
193 begainners 1
194 Dfs and similar 1
195 Dynamic Programmin 1
196 uva 1
197 binary searcj 1
198 Dynam 1
199 Coordinate Compression 1
200 algorithm 1
201 ista = LGBT head 1
202 109 1
203 uri 1
204 omar 1
205 Disjoint Set Union 1
206 brute 1
207 acm egypt 1
208 pc 1
209 Begginer 1
210 general 1
211 vectors 1
212 Stable Marriage 1
213 scc 1
214 sieve 1
215 suffix array 1
216 bi connected component 1
217 ciclos 1
218 SRP_HOMEWORK_01 1
219 ad 0
220 permutation 0
221 queue 0
222 tarjan 0
223 dynaamic 0
224 graph 0
225 div 2C 0
226 Combi 0
227 N Queen problem 0
228 codeforce 0
229 arrey 0
230 Water 0
231 amman cpc 2015 0
232 PST Winter Camp 0
233 Groups 0
234 bipartite 0
235 Translation 0
236 beginners 0
237 JCPC 0
238 C# 0
239 search 0
240 35936 - EWU_CSE 105_Spring 2018_Section 6_Lab Contest 1 0
241 binary index tree 0
242 Acm world final 2011 0
243 mobbius 0
244 knapsack 0
245 Benha ACM 0
246 pattern search 0
247 indonesia 0
248 level 1 0
249 level 2 0
250 implemntation 0
251 dfs & bfs 0
252 dilworth 0
253 Mispelling 0
254 pst0 0
255 modular arithmatic 0
256 codechef 0
257 grid 0
258 andres 0
259 art 0
260 frequency 0
261 28239 0
262 dpinto 0
263 matrices 0
264 andrerabelo 0
265 merge sort 0
266 aho 0
267 closest pair of point 0
268 coin row 0
269 arraya 0
270 bitset 0
271 ACM Syrian Collegiate Programming Contest 2 0
272 exchange argument 0
273 power 0
274 dag 0
275 22134 - LP1-FPUNA-2015 0
276 1c 0
277 codeforces DIv.2A 0
278 recursive 0
279 stable roomate 0
280 seg 0
281 Problem 2 Component Testing 0
282 rabin 0
283 p'[ 0
284 centroid 0
285 problem set 0
286 Ahmad 0
287 back 0
288 bipartite matching 0
289 xor 0
290 10945 0
291 Google Code Jam 0
292 so easy 0
293 Div 2 B 0
294 heavy light decomposition 0
295 sort drinking 0
296 training round 0
297 disjoint set 0
298 prefi 0
299 fast fourier 0
300 niquefa 0
301 codeforces div 1 0
302 binary searsh 0
303 mo's algo 0
304 bitmask DP 0
305 fibo 0
306 basic programming 0
307 segmentation tree 0
308 suffix 0
309 353 0
310 primes 0
311 nfa 0
312 loops 0
313 priority queue 0
314 sqrt 0
315 adhoc 0
316 recurssion 0
317 binry 0
318 interval tree 0
319 Mid-Central USA 0
320 a2 0
321 back track 0
322 number 0
323 tree 0
324 palindrome 0
325 disjoint union 0
326 depth first search 0
327 473 0
328 multiset 0
329 icpc 0
330 Partial sum 0
331 lucas theorem 0
332 quick sort 0
333 fractal 0
334 flow 0
335 hosam 0
336 DIV 2 A 0
337 dy 0
338 Consecutive Ranges 0
339 math geometry 0
340 obi 0
341 backtacking 0
342 Dijkstra dfs bfs 0
343 Beginer 0
344 url 0
345 *1000 0
346 cummulative 0
347 r 0
348 floyed 0
349 codeforce div1 catagori A 0
350 acm phase 0 0
351 oc 0
352 Algo 0
353 acam 0
354 two pointerd 0
355 digit 0
356 UFG 0
357 13 0
358 linkedlist 0
359 dynamic programmig 0
360 heap 0
361 Sweep 0
362 fermat 0
363 A2OJ FCI-CU 0
364 zu 0
365 Bfs Dfs 0
366 the life 0
367 disjoint 0
368 data 0
369 Codeforces Div. 1 - A Problems 0
370 knj 0
371 extended 0
372 toplogical sort 0
373 fenwick 0
374 factoradic 0
375 Graphs & DP Div2 D - E Codeforces 0
376 rec 0
377 A 0
378 region 0
379 bs 0
380 Add them twice 0
381 permutatiin 0
382 UNCC ACM 0
383 counting 0
384 crazy search 0
385 biginteger 0
386 matching 0
387 dynamic problem 0
388 FortunA 0
389 dynamic programming,codeforces DIV 2 D 0
390 str 0
391 zbox 0
392 maps 0
393 ahmeddahi92 0
394 two pointer 0
395 . Translation 0
396 195 0
397 hash 0
398 dijstrika 0
399 PI-UFS-T01 0
400 bitmask 0
401 Div2 0
402 Lenear Search 0
403 ad hock 0
404 fenqick tree 0
405 ternary 0
406 greeady 0
407 contiguous longest subarray 0
408 hakenbush 0
409 Codeforces Div.1 - A problems 0
410 warshall 0
411 implmentation 0
412 re 0
413 noba_96 0
414 graph theory 0
415 sets 0
416 d 0
417 pointer 0
418 backtraking 0
419 frequency arrays 0
420 binary sarch 0
421 easy 0
422 geomtry 0
423 Avanzada 0
424 binary 0
425 bellman 0
426 struct 0
427 k 0
428 djikstra 0
429 sparse 0
430 ECPC 0
431 map 0
432 A - Siggy?s sum 0
433 binary sear 0
434 AVL 0
435 breath first search 0
436 segment 0
437 codeforces Div 1 A 0
438 bitmask problems 0
439 jj 0
440 floyd 0
441 1119 0
442 java 0
443 number theory problems 0
444 Dinamic 0
445 seive 0
446 articulation 0
447 dd 0
448 link list 0
449 Pattern 0
450 Practice 0
451 longest common subsequence 0
452 floyd warshall 0
453 e 0
454 web 0
455 ACM Tunisian Collegiate Programming Contest 2013 & ACM Jordanian Collegiate Programming Contest 2013 0
456 Treinamento1604 0
457 Iterative Complete Seach 0
458 bitmasking 0
459 s 0
460 B 0
461 repeti?ao 0
462 bitmasks problems 0
463 begineer 0
464 201 0
465 maths 0
466 binary exponentitation 0
467 2791 - Lagrange's Four-Square Theorem 0
468 recursively divide and conquer 0
469 352-Pesky Palindromes 0
470 Iona santana 0
471 vector 0
472 North America - Mid-Central USA 0
473 sort 0
474 square root 0
475 Codeforces Div. 1, E 0
476 union find 0
477 graphe 0
478 Div 2 0
479 159 0
480 add hoc 0
481 The_Battle 0
482 heap sort 0
483 dynamic programing 0
484 priority queues 0
485 div 0
486 jugal 0
487 abed 0
488 gallup poll 0
489 decode 0
490 bits 0
491 union 0
492 Chinese Postman Problem 0
493 garf 0
494 0/1 0
495 Contest Hall Preparation 0
496 shortestpath 0
497 classes 0
498 Seguimiento basicos 0
499 SPC 0
500 object oriented 0
501 comb 0
502 cumulative sum 0
503 greedy problem 0
504 game 0
505 Simple Math 0
506 bin 0
507 Graph Coloring Welsh-Powell Algorithm 0
508 reursion 0
509 manel maatouk 0
510 dynamic 0
511 jzzhu and sequences 0
512 expectation 0
513 15822 0
514 flo 0
515 graph coloring 0
516 https://a2oj.com/category?ID=408 0
517 priority 0
518 bridges 0
519 abdalrahmanatwah 0
520 252 0
521 crggamers 0
522 arab 0
523 pinary search 0
524 matrix 0
525 backtrack 0
526 euler totient 0
527 dynamic p 0
528 convex 0
529 1600 0
530 kruskal 0
531 coci 0
532 longest 0
533 Div.2-C 0
534 29708 - ContestPreparation 0
535 structs 0
536 customfurnish 0
537 function 0
538 eol 0
539 LCIS 0
540 window sliding 0
541 strongly connected 0
542 kmp algo 0
543 LP1-I_so_love_programming! 0
544 Bitmanipulation 0
545 divide 0
546 koki 0
547 184. Strings with Same Letters 0
548 breadth first search 0
549 fast matrix exponentiation 0
550 graph matching 0
551 set 0
552 floodfill 0
553 convert time 0
554 cumulative 0
555 knapsack algorithm 0
556 mathematical 0
557 basic 0
558 SAMO 0
559 max flow 0
560 disjoint ser 0
561 india 0
562 184 0
563 game thery 0
564 Codeforces Div.1-A Problems 0
565 c 0
566 bigmod 0
567 vec 0
568 loop 0
569 topcoder 0
570 graps 0
571 books 0
572 bina 0
573 Media 0
574 dp bitmask 0
575 MaratonIME 0
576 stack 0
577 linked lists 0
578 z 0
579 acm sham 0
580 Windows 0
581 meet-in-the-middle 0
582 div1 0
583 link 0
584 ST; 0
585 Mother bear uva 0
586 2-sat 0
587 ACM Arab Collegiate Programming Contest 2013 0
588 m 0
589 sorting 0
590 codefoces 0
591 array 0
592 Ladder 0
593 np 0
594 training round #2 0
595 gemastik 0
596 Subarray 0
597 codeforce A 0
598 recurion 0
599 sara reda 0
600 ninary 0
601 rolling hash 0
602 Recordare 0
603 Theatre Square 0
604 BIT 0
605 codeforces Div2 A 0
606 adoc 0
607 binary tree 0
608 simple 0
609 euclid 0
610 ifrn 0
611 list 0
612 twins 0
613 Complete Search 0
614 Mriganga 0
615 ent 0
616 probability 0
617 bit mask 0
618 adhocv 0
619 Sparse Table 0
620 geekhamza 0
621 thenoobestever 0
622 30008 0
623 accum 0
624 125. Objects Count 0
625 upper bound 0
626 biney index tree 0
627 facil 0
628 Iniciante - Aracode 0
629 Alisson viana 0
630 Gammal 0
631 Palindromes 0
632 hossamyosef 0
633 sweep line 0
634 regionals 0
635 trre 0
636 Math & Geometry 0
637 a canh 0
638 palan 0
639 SERCLE DEATH 0
640 Binary Search Trees 0
641 mineira 0
642 Educational 0
643 D-Codeforces 0
644 hbb 0
645 acmASCIS Level 1 Training '19 0
646 Capital City 0
647 stacks 0
648 bainary search 0
649 codeforces div 1-a 0
650 recurrsion 0
651 Joud Khattab 0
652 Junior Training Sheet - template - v4.4 0
653 recursiom 0
654 kadane 0
655 Sheet: https://a2oj.com/register?ID=32538 0
656 manacher algorithm 0
657 2A 0
658 prefix sum 0
659 bit masking 0
660 spoj 0
661 shop 0
662 Topological sort 0
663 ternary search 0
664 caoyu01 0
665 impemention 0
666 topological sory 0
667 meet 0
668 1160 0
669 batrr 0
670 combination 0
671 timus 0
672 range minimum querry 0
673 regions 0
674 number system 0