You must be logged in to add a new category

Search in :
Search for :

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