You must be logged in to add a new category

Search in :
Search for :

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