You must be logged in to add a new category

Search in :
Search for :

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