You must be logged in to add a new category

Search in :
Search for :

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