You must be logged in to add a new category

Search in :
Search for :

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