You must be logged in to add a new category

Search in :
Search for :

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