You must be logged in to add a new category

Search in :
Search for :

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