You must be logged in to add a new category

Search in :
Search for :

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