You must be logged in to add a new category

Search in :
Search for :

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