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