You must be logged in to add a new category

Search in :
Search for :

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