You must be logged in to add a new category

Search in :
Search for :

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