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