You must be logged in to add a new category

Search in :
Search for :

Category Problems Count
1 Dynamic Programming 1082
2 implementation 969
3 math 595
4 Greedy 553
5 DFS & BFS & Dijkstra 511
6 brute force 440
7 Codeforces Div. 2 - A Problems 431
8 Codeforces Div. 2 - B Problems 427
9 Codeforces Div. 2 - C Problems 423
10 data structures 422
11 Codeforces Div. 2 - D Problems 420
12 Codeforces Div. 2 - E Problems 414
13 Binary Search & Ternary Search 309
14 constructive algorithms 286
15 sortings 283
16 graphs 246
17 Number Theory 221
18 Geometry 205
19 strings 194
20 combinatorics 192
21 trees 166
22 Codeforces Div. 1, D 156
23 Network Flow 151
24 probabilities 142
25 Segment Tree 140
26 two pointers 116
27 bitmasks 100
28 dsu 97
29 Matrix Power 84
30 MST,Disjoint sets,SCC 76
31 games 71
32 hashing 70
33 Binary Indexed Tree 61
34 Ad-hoc 59
35 divide and conquer 57
36 Maximum Matching / Vertex Cover on Bipartite Graph 48
37 Codeforces Div. 2 - F Problems 46
38 backtracking 39
39 Non-Classical Dynamic Programming 36
40 Trie 35
41 bfs 33
42 expresison and parsing 32
43 string suffix structures 32
44 Heavy-Light Descomposition 28
45 KMP 28
46 0/1 Knapsack 27
47 Suffix Array/Tree 27
48 Meet in The Middle 26
49 The_scorpion 24
50 LIS 21
51 Balanced Binary Search Trees 21
52 ACM-ICPC Dhaka Site Regional Contests 20
53 TopologicalSort 20
54 polynomial 20
55 FFT 20
56 All Pair Shortest Path (Floyd-Warshall) 18
57 LCA 16
58 MO?s Algorithm (Query square root decomposition) 16
59 Convex hull 15
60 Suffix automaton 14
61 back-tracking 14
62 Lowest Common Ancestor 14
63 Aho-Corasick 13
64 Codeforces Practice List 13
65 Reasoning 13
66 line sweep 13
67 EulerianTour 13
68 Hungarian Algorithm 13
69 2sat 12
70 LCS 12
71 Gaussian elimination 11
72 Strongly Connected Components 11
73 beginner 10
74 Strategy 10
75 Centroid Decomposition 9
76 Edit Distance 9
77 STL 9
78 Coin Change 9
79 Math Games 9
80 Complete Searsh 8
81 Articulation Point 8
82 Heaps 8
83 bit manipulation 7
84 segment trees 7
85 DFS&BFS 7
86 Bellman-Ford 6
87 STOP ADDING DUMP CATEGORIES 6
88 Simulation 6
89 ad hoc 6
90 MCM & OBST 6
91 0/1 BFS 5
92 big numbers 5
93 RMQ 5
94 Rabin-Karp 5
95 Simulated Annealing 5
96 Minimum Spanning Tree 5
97 Game Theory 5
98 kth shortest path 5
99 Dijkstra 5
100 Treap 5
101 Optimization 5
102 SGU Problems 5
103 Recursion 4
104 AI 4
105 Iniciante 4
106 Partitioning 4
107 tries 4
108 schedules 4
109 Grid compression 4
110 chinese remainder theorem 4
111 matrix exponentiation 4
112 Difference Constraints 3
113 Newton Raphson method 3
114 Range tree 3
115 digit dp 3
116 Float precision 3
117 linked list 3
118 Pigeonhole principle 2
119 acm 2
120 ista breaks up with shreya 2
121 Polygon centroid 2
122 Minimum Enclosing Circle 2
123 frequency ARRAY 2
124 Minkowski addition 2
125 big mod 2
126 binar search 2
127 justSama 2
128 string 2
129 flood fill 2
130 Max points on line 2
131 Algorithm X 2
132 Z algorithm 2
133 Factoradic Index 2
134 Biconnected Component 2
135 dinamyc porograming 2
136 Voronoi 2
137 Alignment 2
138 dp 2
139 SQRT Heuristic 2
140 bi connected component 1
141 suffix array 1
142 prime 1
143 dfs 1
144 Minimum cost arborescence 1
145 algorithms 1
146 Linear Programming 1
147 dynammic programming 1
148 Basica 1
149 MST 1
150 kingdon 1
151 maximum empty rectangle 1
152 Logic 1
153 Mathematical Questions 1
154 Codeforces 1
155 binary search tree 1
156 begainners 1
157 contest 1
158 Circle sweep 1
159 SRM 557 DivII 250 1
160 Coordinate Compression 1
161 ista = LGBT head 1
162 Disjoint Set Union 1
163 ECPC 2014 1
164 data structure 1
165 disunion set 1
166 acm egypt 1
167 uva 1
168 Dynam 1
169 binary search 1
170 uri 1
171 omar 1
172 109 1
173 SRP_HOMEWORK_01 1
174 Arrays 1
175 general 1
176 Stable Marriage 1
177 Begginer 1
178 bst 1
179 binry 0
180 Joud Khattab 0
181 a2 0
182 basic programming 0
183 2A 0
184 353 0
185 Capital City 0
186 priority queue 0
187 bainary search 0
188 caoyu01 0
189 impemention 0
190 1160 0
191 palindrome 0
192 range minimum querry 0
193 473 0
194 spoj 0
195 lucas theorem 0
196 Topological sort 0
197 div 2C 0
198 codeforce 0
199 amman cpc 2015 0
200 obi 0
201 Dijkstra dfs bfs 0
202 queue 0
203 cummulative 0
204 graph 0
205 C# 0
206 oc 0
207 knapsack 0
208 two pointerd 0
209 indonesia 0
210 13 0
211 beginners 0
212 heap 0
213 Bfs Dfs 0
214 andres 0
215 data 0
216 toplogical sort 0
217 implemntation 0
218 Mispelling 0
219 gcd 0
220 Add them twice 0
221 ACM Syrian Collegiate Programming Contest 2 0
222 UNCC ACM 0
223 22134 - LP1-FPUNA-2015 0
224 matching 0
225 dynamic programming,codeforces DIV 2 D 0
226 andrerabelo 0
227 merge sort 0
228 Problem 2 Component Testing 0
229 rabin 0
230 two pointer 0
231 Ahmad 0
232 hash 0
233 10945 0
234 Div2 0
235 ternary 0
236 recursive 0
237 training round 0
238 disjoint set 0
239 hakenbush 0
240 niquefa 0
241 re 0
242 Div 2 B 0
243 d 0
244 pattern searching 0
245 nfa 0
246 adhoc 0
247 topological 0
248 Mid-Central USA 0
249 bellman 0
250 fibo 0
251 djikstra 0
252 suffix 0
253 icpc 0
254 Dinamic 0
255 flow 0
256 codeforces Div 1 A 0
257 tree 0
258 floyd 0
259 depth first search 0
260 bitmasking 0
261 B 0
262 url 0
263 link list 0
264 Queues 0
265 dy 0
266 web 0
267 math geometry 0
268 vector 0
269 UFG 0
270 sort 0
271 bitmasks problems 0
272 acm phase 0 0
273 2791 - Lagrange's Four-Square Theorem 0
274 acam 0
275 extended 0
276 factoradic 0
277 A 0
278 Div 2 0
279 zu 0
280 disjoint 0
281 div 0
282 knj 0
283 biginteger 0
284 union 0
285 zbox 0
286 0/1 0
287 ahmeddahi92 0
288 classes 0
289 Graph basics concepts BFS & DFS 0
290 comb 0
291 crazy search 0
292 ad hock 0
293 Simple Math 0
294 reursion 0
295 jzzhu and sequences 0
296 195 0
297 flo 0
298 PI-UFS-T01 0
299 bitmask 0
300 graph theory 0
301 bridges 0
302 matrix 0
303 warshall 0
304 implmentation 0
305 longest 0
306 ECPC 0
307 29708 - ContestPreparation 0
308 function 0
309 easy 0
310 LCIS 0
311 Avanzada 0
312 binary 0
313 bitmask problems 0
314 LP1-I_so_love_programming! 0
315 1119 0
316 breadth first search 0
317 breath first search 0
318 set 0
319 segment 0
320 floyd warshall 0
321 mathematical 0
322 Treinamento1604 0
323 max flow 0
324 game thery 0
325 dd 0
326 Kadane's Algorithm 0
327 Pattern 0
328 Practice 0
329 link 0
330 maths 0
331 2-sat 0
332 352-Pesky Palindromes 0
333 books 0
334 North America - Mid-Central USA 0
335 acm sham 0
336 rolling hash 0
337 add hoc 0
338 Dfs and similar 0
339 maxflow 0
340 dynamic programing 0
341 sorting 0
342 abed 0
343 Ladder 0
344 Codeforces Div. 1, E 0
345 codeforce A 0
346 graphe 0
347 Mriganga 0
348 shortestpath 0
349 SPC 0
350 codeforces Div2 A 0
351 binary tree 0
352 bits 0
353 ifrn 0
354 Chinese Postman Problem 0
355 garf 0
356 Gammal 0
357 dynamic 0
358 Palindromes 0
359 15822 0
360 geekhamza 0
361 30008 0
362 game 0
363 biney index tree 0
364 Graph Coloring Welsh-Powell Algorithm 0
365 pinary search 0
366 backtrack 0
367 regionals 0
368 convex 0
369 a canh 0
370 coci 0
371 SERCLE DEATH 0
372 252 0
373 D-Codeforces 0
374 arab 0
375 customfurnish 0
376 stacks 0
377 codeforces div 1-a 0
378 Junior Training Sheet - template - v4.4 0
379 Sheet: https://a2oj.com/register?ID=32538 0
380 structs 0
381 ciclos 0
382 knapsack algorithm 0
383 topological sory 0
384 divide 0
385 combination 0
386 184. Strings with Same Letters 0
387 c 0
388 ad 0
389 vec 0
390 tarjan 0
391 graps 0
392 Combi 0
393 SAMO 0
394 istasis likes dhinchak pooja 0
395 india 0
396 184 0
397 stack 0
398 linked lists 0
399 bipartite 0
400 meet-in-the-middle 0
401 fenwick tree 0
402 Mother bear uva 0
403 search 0
404 Acm world final 2011 0
405 Media 0
406 dp bitmask 0
407 training round #2 0
408 gemastik 0
409 level 1 0
410 sara reda 0
411 dfs & bfs 0
412 Theatre Square 0
413 pst0 0
414 m 0
415 array 0
416 A - Siggy?s sum 0
417 euclid 0
418 28239 0
419 twins 0
420 matrices 0
421 probability 0
422 aho 0
423 BIT 0
424 arraya 0
425 bipartite matching 0
426 125. Objects Count 0
427 scc 0
428 Google Code Jam 0
429 Iniciante - Aracode 0
430 1c 0
431 stable roomate 0
432 Sparse Table 0
433 centroid 0
434 binary searsh 0
435 matrix multiplication problem 0
436 mineira 0
437 heavy light decomposition 0
438 hbb 0
439 sort drinking 0
440 Math & Geometry 0