You must be logged in to add a new category

Search in :
Search for :

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