You must be logged in to add a new category

Search in :
Search for :

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