You must be logged in to add a new category

Search in :
Search for :

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