You must be logged in to add a new category

Search in :
Search for :

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