You must be logged in to add a new category

Search in :
Search for :

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