*Dear Visitor,
If you arrive at this page because you are (Google-)searching for hints/solutions for some of these 2.95K+ UVa/Kattis online judge problems
and you do not know about "Competitive Programming" text book yet, you may be interested to get one copy where I discuss
the required data structure(s) and/or algorithm(s) for those problems :).
Alternatively, you can also visit my other tool VisuAlgo (free) for animated explanations of some of
those data structure(s) and/or algorithm(s).
If you arrive at this page because of CP3 (published 24 May 2013),
please notice that this page contains the most up-to-date version of CPbook problem classification at UVa or uHunt pages
(dubbed CP3.19a++, information is up to date as of 15 May 2019).
The major update is the inclusion of ~1K+ Kattis online judge problems
on top of the ~2K UVa online judge problems (there are some overlap, around 90+,
search substring "also available at Kattis" / "also available at UVa" to find such problems).
Also, if you are a Google Chrome and Kattis user, use this nice Kattis Hint Giver created by one of my student Lin Si Jie that integrates this page directly with Kattis problems pages (you may want to occassionally 'Remove from Chrome' and re-'Add to Chrome' to manually sync this Methods to Solve content with the local cache).
Regards,
Dr Steven Halim, NUS ICPC head coach, ICPC Asia Singapore Regional Contest Director, Singapore IOI team leader, IOI 2020 Deputy Chairman.
Btw, browsing these ~3K problems may feel daunting for beginners, so feel free to use the following filters:
*

- NUS CS1010/E/S/CS1101S : (Basic) Programming Methodology level: I/O, Sequence, Selection, Repetition, Control Flow, Function, Easy Problems, 1D/2D Array, Simple Sorting, Binary Search, Basic Math, Basic String
- NUS CS2040/C/S : (Basic) Data Structures and Algorithms level: 1D/2D Array/Vector, Sorting, Linked List, Binary Heap, Hash Table, Binary Search Tree, Graph DS, Graph Traversal, SSSP
- NUS CS3230 : Design and Analysis of Algorithms level: Sorting (Harder), BF, D&C (+MatPow, Closest Pair), Greedy, DP (+APSP, Combinatorics, DP String), MST (+Union-Find), SSSP (Harder), String Matching, Convex Hull, NP-hard Problems
- NUS CS4234 : Optimisation Algorithms level: Complete Search (small instances), DP (esp Pseudo-Polynomial versions), NP-hard Problems, Max Flow, Graph Matching (+Weighted MCBM), Linear Programming
- CP3.19a, "Chapter 1 : Introduction" starred problems only or CP3.19a, all Chapter 1 problems
- CP3.19a, "Chapter 2 : Data Structures and Libraries" starred problems only or CP3.19a, all Chapter 2 problems
- CP3.19a, "Chapter 3 : Problem Solving Paradigms" starred problems only or CP3.19a, all Chapter 3 problems
- CP3.19a, "Chapter 4 : Graph" starred problems only or CP3.19a, all Chapter 4 problems
- CP3.19a, "Chapter 8 : More Advanced Topics" starred problems only or CP3.19a, all Chapter 8 problems
- Only starred problems from all chapters
- If no (or wrong) filter is specified, we will list down all problems, including all those uncategorized 'non-starred' problems (for NUS CS3233/ICPC: Competitive Programming level)

UVa/Kattis | Problem Title | CP3.19a++ |
---|---|---|

00100 | Fetching from uHunt | 5.2a, Math Simulation, Easier |

00151 | Fetching from uHunt | 9.jose, Josephus Problem |

00156 | Fetching from uHunt | 9.anag, Anagram |

00161 | Fetching from uHunt | 1.4e, Real Life, Easier |

00165 | Fetching from uHunt | 3.2a, Pre-calculate-able |

00183 | Fetching from uHunt | 3.3c, Other DnC Problems |

00185 | Fetching from uHunt | 9.roma, Roman Numerals |

00188 | Fetching from uHunt | 3.2g, Try All Possible Answers |

00195 | Fetching from uHunt | 9.anag, Anagram |

00200 | Fetching from uHunt | 4.2d, Topological Sort |

00208 | Fetching from uHunt | 3.2i, Backtracking (Harder) |

00209 | Fetching from uHunt | 7.2f, Quadrilaterals |

00213 | Fetching from uHunt | 6.3b, Cipher, Harder |

00216 | Fetching from uHunt | 3.5e, TSP |

00222 | Fetching from uHunt | 3.2i, Backtracking (Harder) |

00234 | Fetching from uHunt | 3.2e, Iterative (Permutation) |

00242 | Fetching from uHunt | 3.5d, Coin-Change |

00247 | Fetching from uHunt | 4.2g, SCCs |

00255 | Fetching from uHunt | 1.4b, Game (Chess) |

00264 | Fetching from uHunt | 5.2e, Grid |

00278 | Fetching from uHunt | 1.4b, Game (Chess) |

00280 | Fetching from uHunt | 4.2a, Just Graph Traversal |

00291 | Fetching from uHunt | 4.8f, Eulerian Graph |

00294 | Fetching from uHunt | 5.5f, Prime Factors Functions |

00295 | Fetching from uHunt | 8.5h, Three Components |

00299 | Fetching from uHunt | 9.inve, Inversion Index |

00307 | Fetching from uHunt | 3.2i, Backtracking (Harder) |

00314 | Fetching from uHunt | 4.4b, SSSP, BFS, Harder |

00315 | Fetching from uHunt | 4.2f, Articulation Points/Bridges |

00325 | Fetching from uHunt | 6.3f, Regular Expression |

00332 | Fetching from uHunt | 5.2j, Fractions |

00336 | Fetching from uHunt | 4.4a, SSSP, BFS, Easier |

00343 | Fetching from uHunt | 5.3c, Bonus: Base Number |

00344 | Fetching from uHunt | 9.roma, Roman Numerals |

00350 | Fetching from uHunt | 5.7a, Cycle Finding |

00352 | Fetching from uHunt | 4.2b, Flood Fill, Easier |

00361 | Fetching from uHunt | 7.3b, Polygon, Harder |

00369 | Fetching from uHunt | 5.4b, Binomial Coefficients |

00377 | Fetching from uHunt | 5.2i, Base Number Variants |

00378 | Fetching from uHunt | 7.2b, Lines |

00382 | Fetching from uHunt | 5.2a, Math Simulation, Easier |

00386 | Fetching from uHunt | 3.2d, Three+ Nested Loops, Harder |

00389 | Fetching from uHunt | 5.3c, Bonus: Base Number |

00393 | Fetching from uHunt | 8.5d, Graph and Other |

00397 | Fetching from uHunt | 6.3d, Iterative Parsing |

00401 | Fetching from uHunt | 9.pala, Palindrome (Checking) |

00417 | Fetching from uHunt | 2.3d, Hash Table (map) |

00422 | Fetching from uHunt | 6.4b, String Matching, 2D Grid |

00427 | Fetching from uHunt | 7.2d, Triangles (Trigonometry) |

00429 | Fetching from uHunt | 4.4a, SSSP, BFS, Easier |

00438 | Fetching from uHunt | 7.2e, Triangles + Circles |

00439 | Fetching from uHunt | 9.knig, Knight Moves |

00441 | Fetching from uHunt | 3.2c, Three+ Nested Loops, Easier |

00443 | Fetching from uHunt | 5.2f, Number Systems/Sequences |

00452 | Fetching from uHunt | 4.8a, Shortest Paths on DAG |

00476 | Fetching from uHunt | 7.2f, Quadrilaterals |

00481 | Fetching from uHunt | 3.5b, LIS |

00488 | Fetching from uHunt | 6.3g, Output Formatting, Easier |

00489 | Fetching from uHunt | 1.4c, Game (Others), Easier |

00494 | Fetching from uHunt | 6.3f, Regular Expression |

00495 | Fetching from uHunt | 5.4a, Fibonacci Numbers |

00496 | Fetching from uHunt | 5.2k, Just Ad Hoc |

00499 | Fetching from uHunt | 2.3b, Direct Addressing Table |

00514 | Fetching from uHunt | 2.2f, Stack |

00535 | Fetching from uHunt | 9.grea, Great Circle Distance |

00536 | Fetching from uHunt | 4.8d, Tree |

00539 | Fetching from uHunt | 8.4a, NP-hard/C, small, Easier |

00543 | Fetching from uHunt | 5.5a, Prime Numbers |

00551 | Fetching from uHunt | 9.brac, Bracket Matching |

00554 | Fetching from uHunt | 6.3b, Cipher, Harder |

00558 | Fetching from uHunt | 4.4e, SSSP, -ve weight |

00563 | Fetching from uHunt | 4.6b, Network Flow, Variants |

00572 | Fetching from uHunt | 4.2b, Flood Fill, Easier |

00573 | Fetching from uHunt | 1.3h, Medium |

00575 | Fetching from uHunt | 5.2i, Base Number Variants |

00576 | Fetching from uHunt | 6.3f, Regular Expression |

00579 | Fetching from uHunt | 1.4g, Time, Easier |

00583 | Fetching from uHunt | 5.5d, Finding Prime Factors |

00584 | Fetching from uHunt | 1.4d, Game (Others), Harder |

00587 | Fetching from uHunt | 7.2a, Points |

00588 | Fetching from uHunt | 9.artg, Art Gallery |

00589 | Fetching from uHunt | 4.4d, SSSP, Dijkstra, Harder |

00590 | Fetching from uHunt | 4.8c, Conversion to DAG |

00592 | Fetching from uHunt | 3.2b, Iterative (Two Nested Loops) |

00599 | Fetching from uHunt | 2.4a, Graph Data Structures |

00608 | Fetching from uHunt | 3.3c, Other DnC Problems |

00612 | Fetching from uHunt | 9.inve, Inversion Index |

00616 | Fetching from uHunt | 5.2b, Math Simulation, Harder |

00620 | Fetching from uHunt | 6.3e, Recursive Parsing |

00623 | Fetching from uHunt | 5.5c, Factorial |

00624 | Fetching from uHunt | 8.4a, NP-hard/C, small, Easier |

00634 | Fetching from uHunt | 7.3a, Polygon, Easier |

00637 | Fetching from uHunt | 1.4e, Real Life, Easier |

00639 | Fetching from uHunt | 3.2f, Iterative (Combination) |

00644 | Fetching from uHunt | 6.3i, String Comparison |

00652 | Fetching from uHunt | 9.asta, A* or IDA* |

00656 | Fetching from uHunt | 9.asta, A* or IDA* |

00657 | Fetching from uHunt | 4.2c, Flood Fill, Harder |

00658 | Fetching from uHunt | 8.2d, State-Space, Dijkstra |

00662 | Fetching from uHunt | 8.3a, DP level 2 |

00670 | Fetching from uHunt | 4.8e, Bipartite Graph |

00672 | Fetching from uHunt | 8.3b, DP level 3 |

00673 | Fetching from uHunt | 9.brac, Bracket Matching |

00674 | Fetching from uHunt | 3.5d, Coin-Change |

00696 | Fetching from uHunt | 1.4b, Game (Chess) |

00701 | Fetching from uHunt | 5.2g, Log, Exp, Pow |

00702 | Fetching from uHunt | 8.3d, Counting Paths, Harder |

00706 | Fetching from uHunt | 1.4f, Real Life, Harder |

00711 | Fetching from uHunt | 8.2a, Challenging Backtracking |

00713 | Fetching from uHunt | 5.3a, Big Integer, Basic |

00714 | Fetching from uHunt | 8.5a, Bsearch-ans and Others |

00725 | Fetching from uHunt | 3.2g, Try All Possible Answers |

00729 | Fetching from uHunt | 3.2h, Backtracking (Easier) |

00735 | Fetching from uHunt | 3.2c, Three+ Nested Loops, Easier |

00736 | Fetching from uHunt | 6.4b, String Matching, 2D Grid |

00740 | Fetching from uHunt | 6.3b, Cipher, Harder |

00750 | Fetching from uHunt | 3.2a, Pre-calculate-able |

00759 | Fetching from uHunt | 9.roma, Roman Numerals |

00763 | Fetching from uHunt | 5.4a, Fibonacci Numbers |

00787 | Fetching from uHunt | 3.5a, Max 1D/2D Range Sum |

00820 | Fetching from uHunt | 4.6a, Network Flow, Standard |

00821 | Fetching from uHunt | 4.5a, APSP, Standard |

00825 | Fetching from uHunt | 4.8b, Counting Paths, Easier |

00834 | Fetching from uHunt | 5.2j, Fractions |

00869 | Fetching from uHunt | 4.5b, APSP, Variants |

00871 | Fetching from uHunt | 4.2b, Flood Fill, Easier |

00872 | Fetching from uHunt | 4.2d, Topological Sort |

00902 | Fetching from uHunt | 6.3c, Frequency Counting |

00907 | Fetching from uHunt | 4.8c, Conversion to DAG |

00918 | Fetching from uHunt | 6.3h, Output Formatting, Harder |

00927 | Fetching from uHunt | non-starred |

00930 | Fetching from uHunt | 5.2h, Polynomial |

00947 | Fetching from uHunt | 1.4c, Game (Others), Easier |

00976 | Fetching from uHunt | 8.5c, Graph and DP |

00978 | Fetching from uHunt | 2.3e, Balanced BST (set) |

00989 | Fetching from uHunt | 8.4a, NP-hard/C, small, Easier |

00991 | Fetching from uHunt | 5.4c, Catalan Numbers |

01013 | Fetching from uHunt | 4.3b, MST, Variants |

01040 | Fetching from uHunt | 8.5h, Three Components |

01045 | Fetching from uHunt | 9.kuhn, Kuhn Munkres's Algorithm |

01047 | Fetching from uHunt | 3.2f, Iterative (Combination) |

01048 | Fetching from uHunt | 8.2d, State-Space, Dijkstra |

01052 | Fetching from uHunt | 8.2a, Challenging Backtracking |

01056 | Fetching from uHunt | 4.5b, APSP, Variants |

01057 | Fetching from uHunt | 8.2d, State-Space, Dijkstra |

01061 | Fetching from uHunt | 1.4f, Real Life, Harder |

01062 | Fetching from uHunt | 2.2f, Stack |

01064 | Fetching from uHunt | 3.2e, Iterative (Permutation) |

01069 | Fetching from uHunt | 8.5e, Maths and Other |

01086 | Fetching from uHunt | 8.4d, NP-hard/C, special, Harder |

01091 | Fetching from uHunt | 1.4f, Real Life, Harder |

01092 | Fetching from uHunt | 8.5d, Graph and Other |

01096 | Fetching from uHunt | 8.4d, NP-hard/C, special, Harder |

01098 | Fetching from uHunt | 8.4b, NP-hard/C, small, Harder |

01099 | Fetching from uHunt | 8.3e, DP with Bitmask |

01103 | Fetching from uHunt | 4.2c, Flood Fill, Harder |

01105 | Fetching from uHunt | 3.5a, Max 1D/2D Range Sum |

01111 | Fetching from uHunt | 7.3b, Polygon, Harder |

01112 | Fetching from uHunt | 4.4c, SSSP, Dijkstra, Easier |

01124 | Fetching from uHunt | 1.3c, Repetition Only |

01172 | Fetching from uHunt | 8.3b, DP level 3 |

01176 | Fetching from uHunt | 9.jose, Josephus Problem |

01180 | Fetching from uHunt | 5.3b, (Prob) Prime Testing |

01184 | Fetching from uHunt | 8.4d, NP-hard/C, special, Harder |

01192 | Fetching from uHunt | 6.5a, DP String, Classic |

01193 | Fetching from uHunt | 3.4a, Greedy (Classical) |

01196 | Fetching from uHunt | 3.5b, LIS |

01197 | Fetching from uHunt | 2.4b, Union-Find Disjoint Sets |

01200 | Fetching from uHunt | 6.3d, Iterative Parsing |

01210 | Fetching from uHunt | 5.3b, (Prob) Prime Testing |

01211 | Fetching from uHunt | 8.3b, DP level 3 |

01212 | Fetching from uHunt | 8.4d, NP-hard/C, special, Harder |

01213 | Fetching from uHunt | 3.5c, 0-1 Knapsack |

01221 | Fetching from uHunt | 8.5a, Bsearch-ans and Others |

01224 | Fetching from uHunt | 5.4e, Others, Harder |

01225 | Fetching from uHunt | 5.2a, Math Simulation, Easier |

01230 | Fetching from uHunt | 5.3d, Bonus: Others |

01238 | Fetching from uHunt | 8.3c, DP level 4 |

01239 | Fetching from uHunt | 9.palb, Palindrome (Generating) |

01247 | Fetching from uHunt | 4.5a, APSP, Standard |

01250 | Fetching from uHunt | 8.5h, Three Components |

01252 | Fetching from uHunt | 8.3e, DP with Bitmask |

01254 | Fetching from uHunt | 6.6a, Suffix Trie/Tree/Array |

01262 | Fetching from uHunt | 3.2i, Backtracking (Harder) |

01265 | Fetching from uHunt | 4.3b, MST, Variants |

01304 | Fetching from uHunt | 9.artg, Art Gallery |

01329 | Fetching from uHunt | 2.4b, Union-Find Disjoint Sets |

01347 | Fetching from uHunt | 8.4c, NP-hard/C, special, Easier |

01388 | Fetching from uHunt | 7.2c, Circles |

01449 | Fetching from uHunt | 6.4a, String Matching, Standard |

01571 | Fetching from uHunt | 9.artg, Art Gallery |

01584 | Fetching from uHunt | 6.6a, Suffix Trie/Tree/Array |

01585 | Fetching from uHunt | 1.3d, Control Flow |

01586 | Fetching from uHunt | 1.4e, Real Life, Easier |

01588 | Fetching from uHunt | 3.2b, Iterative (Two Nested Loops) |

01595 | Fetching from uHunt | 7.2a, Points |

01600 | Fetching from uHunt | 8.2b, State-Space, BFS, Easier |

01605 | Fetching from uHunt | 6.3g, Output Formatting, Easier |

01610 | Fetching from uHunt | 2.2d, Sorting, Harder |

01636 | Fetching from uHunt | 5.6a, Probability, Easier |

01644 | Fetching from uHunt | 5.5a, Prime Numbers |

01645 | Fetching from uHunt | 9.form, Formulas or Theorems |

10003 | Fetching from uHunt | 3.5f, DP level 1 |

10004 | Fetching from uHunt | 4.2e, Bipartite Graph |

10005 | Fetching from uHunt | 7.2c, Circles |

10007 | Fetching from uHunt | 5.4c, Catalan Numbers |

10008 | Fetching from uHunt | 6.3c, Frequency Counting |

10010 | Fetching from uHunt | 6.4b, String Matching, 2D Grid |

10018 | Fetching from uHunt | 9.palb, Palindrome (Generating) |

10020 | Fetching from uHunt | 3.4a, Greedy (Classical) |

10022 | Fetching from uHunt | 5.2e, Grid |

10026 | Fetching from uHunt | 3.4c, Involving Sorting, Harder |

10047 | Fetching from uHunt | 8.2b, State-Space, BFS, Easier |

10048 | Fetching from uHunt | 4.3b, MST, Variants |

10054 | Fetching from uHunt | 4.8f, Eulerian Graph |

10056 | Fetching from uHunt | 5.6b, Probability, Harder |

10058 | Fetching from uHunt | 6.3f, Regular Expression |

10071 | Fetching from uHunt | 1.3a, I/O + Sequence Only |

10078 | Fetching from uHunt | 9.artg, Art Gallery |

10090 | Fetching from uHunt | 5.5i, Extended Euclid |

10104 | Fetching from uHunt | 5.5i, Extended Euclid |

10107 | Fetching from uHunt | 2.2c, Sorting, Easier |

10111 | Fetching from uHunt | 5.8a, Game Theory |

10115 | Fetching from uHunt | 6.3j, Ad Hoc String |

10123 | Fetching from uHunt | 8.3c, DP level 4 |

10128 | Fetching from uHunt | 3.2a, Pre-calculate-able |

10130 | Fetching from uHunt | 3.5c, 0-1 Knapsack |

10138 | Fetching from uHunt | 2.3f, Balanced BST (map) |

10145 | Fetching from uHunt | 2.3d, Hash Table (map) |

10161 | Fetching from uHunt | 5.2d, Finding Pattern, Harder |

10172 | Fetching from uHunt | 2.2g, List/Queue/Deque |

10174 | Fetching from uHunt | 5.5h, Modulo Arithmetic |

10176 | Fetching from uHunt | 5.5h, Modulo Arithmetic |

10179 | Fetching from uHunt | 5.5f, Prime Factors Functions |

10181 | Fetching from uHunt | 9.asta, A* or IDA* |

10182 | Fetching from uHunt | 5.2e, Grid |

10188 | Fetching from uHunt | 1.4i, Time Waster |

10189 | Fetching from uHunt | 1.4c, Game (Others), Easier |

10203 | Fetching from uHunt | 4.8f, Eulerian Graph |

10212 | Fetching from uHunt | 5.5h, Modulo Arithmetic |

10223 | Fetching from uHunt | 5.4c, Catalan Numbers |

10229 | Fetching from uHunt | 5.9a, Matrix Power |

10233 | Fetching from uHunt | 5.2e, Grid |

10235 | Fetching from uHunt | 5.3b, (Prob) Prime Testing |

10238 | Fetching from uHunt | 5.6a, Probability, Easier |

10245 | Fetching from uHunt | 9.clos, Closest Pair Problem |

10256 | Fetching from uHunt | 7.3b, Polygon, Harder |

10258 | Fetching from uHunt | 2.2d, Sorting, Harder |

10259 | Fetching from uHunt | 4.8a, Shortest Paths on DAG |

10260 | Fetching from uHunt | 2.3b, Direct Addressing Table |

10263 | Fetching from uHunt | 7.2b, Lines |

10264 | Fetching from uHunt | 2.2e, Bit Manipulation |

10268 | Fetching from uHunt | 5.2h, Polynomial |

10269 | Fetching from uHunt | 8.2d, State-Space, Dijkstra |

10276 | Fetching from uHunt | 3.2a, Pre-calculate-able |

10284 | Fetching from uHunt | 1.4b, Game (Chess) |

10285 | Fetching from uHunt | 4.8a, Shortest Paths on DAG |

10302 | Fetching from uHunt | 5.2h, Polynomial |

10312 | Fetching from uHunt | 5.4c, Catalan Numbers |

10334 | Fetching from uHunt | 5.4a, Fibonacci Numbers |

10340 | Fetching from uHunt | 3.4d, Non Classical, Easier |

10342 | Fetching from uHunt | 4.5b, APSP, Variants |

10344 | Fetching from uHunt | 3.2h, Backtracking (Easier) |

10346 | Fetching from uHunt | 5.2a, Math Simulation, Easier |

10350 | Fetching from uHunt | 4.8a, Shortest Paths on DAG |

10354 | Fetching from uHunt | 4.5a, APSP, Standard |

10356 | Fetching from uHunt | 4.4d, SSSP, Dijkstra, Harder |

10385 | Fetching from uHunt | 9.tern, Ternary Search |

10388 | Fetching from uHunt | 1.4a, Game (Card) |

10393 | Fetching from uHunt | 6.3j, Ad Hoc String |

10405 | Fetching from uHunt | 6.5a, DP String, Classic |

10407 | Fetching from uHunt | 5.5b, GCD and/or LCM |

10408 | Fetching from uHunt | 5.2f, Number Systems/Sequences |

10424 | Fetching from uHunt | 1.3e, Function |

10426 | Fetching from uHunt | 9.knig, Knight Moves |

10432 | Fetching from uHunt | 7.2c, Circles |

10448 | Fetching from uHunt | 3.5d, Coin-Change |

10449 | Fetching from uHunt | 4.4e, SSSP, -ve weight |

10457 | Fetching from uHunt | 4.3b, MST, Variants |

10477 | Fetching from uHunt | 9.knig, Knight Moves |

10489 | Fetching from uHunt | 5.5h, Modulo Arithmetic |

10491 | Fetching from uHunt | 5.6a, Probability, Easier |

10500 | Fetching from uHunt | 6.3g, Output Formatting, Easier |

10505 | Fetching from uHunt | 4.2e, Bipartite Graph |

10523 | Fetching from uHunt | 5.3a, Big Integer, Basic |

10533 | Fetching from uHunt | 8.5b, Other and DP 1D RSQ/RMQ |

10534 | Fetching from uHunt | 3.5b, LIS |

10539 | Fetching from uHunt | 8.5e, Maths and Other |

10541 | Fetching from uHunt | 5.4b, Binomial Coefficients |

10544 | Fetching from uHunt | 4.8b, Counting Paths, Easier |

10559 | Fetching from uHunt | 8.3c, DP level 4 |

10567 | Fetching from uHunt | 3.3a, Binary Search |

10571 | Fetching from uHunt | 8.4b, NP-hard/C, small, Harder |

10576 | Fetching from uHunt | 3.2h, Backtracking (Easier) |

10577 | Fetching from uHunt | 7.2e, Triangles + Circles |

10586 | Fetching from uHunt | 5.2h, Polynomial |

10596 | Fetching from uHunt | 4.8f, Eulerian Graph |

10608 | Fetching from uHunt | 2.4b, Union-Find Disjoint Sets |

10633 | Fetching from uHunt | 5.5i, Extended Euclid |

10637 | Fetching from uHunt | 8.5e, Maths and Other |

10645 | Fetching from uHunt | 8.3b, DP level 3 |

10646 | Fetching from uHunt | 1.4a, Game (Card) |

10648 | Fetching from uHunt | 5.6b, Probability, Harder |

10650 | Fetching from uHunt | 5.5a, Prime Numbers |

10653 | Fetching from uHunt | 4.4a, SSSP, BFS, Easier |

10655 | Fetching from uHunt | 5.9a, Matrix Power |

10656 | Fetching from uHunt | 3.4d, Non Classical, Easier |

10660 | Fetching from uHunt | 3.2d, Three+ Nested Loops, Harder |

10673 | Fetching from uHunt | 5.5i, Extended Euclid |

10678 | Fetching from uHunt | 7.2c, Circles |

10680 | Fetching from uHunt | 5.5e, Prime Factors Related |

10684 | Fetching from uHunt | 3.5a, Max 1D/2D Range Sum |

10685 | Fetching from uHunt | 2.4b, Union-Find Disjoint Sets |

10689 | Fetching from uHunt | 5.4a, Fibonacci Numbers |

10699 | Fetching from uHunt | 5.5g, Modified Sieve |

10746 | Fetching from uHunt | 9.kuhn, Kuhn Munkres's Algorithm |

10751 | Fetching from uHunt | 5.2c, Finding Pattern, Easier |

10755 | Fetching from uHunt | 3.5a, Max 1D/2D Range Sum |

10765 | Fetching from uHunt | 4.2f, Articulation Points/Bridges |

10774 | Fetching from uHunt | 9.jose, Josephus Problem |

10784 | Fetching from uHunt | 5.4e, Others, Harder |

10800 | Fetching from uHunt | 6.3h, Output Formatting, Harder |

10805 | Fetching from uHunt | 4.8d, Tree |

10813 | Fetching from uHunt | 1.4d, Game (Others), Harder |

10814 | Fetching from uHunt | 5.3d, Bonus: Others |

10815 | Fetching from uHunt | 2.3e, Balanced BST (set) |

10821 | Fetching from uHunt | 3.4e, Non Classical, Harder |

10848 | Fetching from uHunt | 9.pala, Palindrome (Checking) |

10851 | Fetching from uHunt | 6.3a, Cipher, Easier |

10854 | Fetching from uHunt | 6.3e, Recursive Parsing |

10859 | Fetching from uHunt | 8.4c, NP-hard/C, special, Easier |

10887 | Fetching from uHunt | 2.3c, Hash Table (set) |

10888 | Fetching from uHunt | 9.kuhn, Kuhn Munkres's Algorithm |

10891 | Fetching from uHunt | 8.5b, Other and DP 1D RSQ/RMQ |

10895 | Fetching from uHunt | 2.4a, Graph Data Structures |

10897 | Fetching from uHunt | 9.grea, Great Circle Distance |

10906 | Fetching from uHunt | 6.3d, Iterative Parsing |

10908 | Fetching from uHunt | 3.2g, Try All Possible Answers |

10911 | Fetching from uHunt | 8.3e, DP with Bitmask |

10912 | Fetching from uHunt | 3.5f, DP level 1 |

10913 | Fetching from uHunt | 4.8c, Conversion to DAG |

10922 | Fetching from uHunt | 5.5j, Other Number Theory |

10925 | Fetching from uHunt | 5.3a, Big Integer, Basic |

10927 | Fetching from uHunt | 7.2a, Points |

10929 | Fetching from uHunt | 5.5j, Other Number Theory |

10931 | Fetching from uHunt | 5.2i, Base Number Variants |

10934 | Fetching from uHunt | 9.eggd, Egg Dropping Puzzle |

10937 | Fetching from uHunt | 8.5c, Graph and DP |

10938 | Fetching from uHunt | 9.lowe, Lowest Common Ancestor |

10940 | Fetching from uHunt | 5.2c, Finding Pattern, Easier |

10942 | Fetching from uHunt | 1.4h, Time, Harder |

10983 | Fetching from uHunt | 8.5a, Bsearch-ans and Others |

10986 | Fetching from uHunt | 4.4c, SSSP, Dijkstra, Easier |

10987 | Fetching from uHunt | 4.5b, APSP, Variants |

10990 | Fetching from uHunt | 5.5g, Modified Sieve |

11008 | Fetching from uHunt | 8.5f, Geometry and Other |

11013 | Fetching from uHunt | 1.4d, Game (Others), Harder |

11032 | Fetching from uHunt | 8.5b, Other and DP 1D RSQ/RMQ |

11036 | Fetching from uHunt | 5.7a, Cycle Finding |

11038 | Fetching from uHunt | 5.2d, Finding Pattern, Harder |

11044 | Fetching from uHunt | 1.3c, Repetition Only |

11048 | Fetching from uHunt | 6.3i, String Comparison |

11053 | Fetching from uHunt | 5.7a, Cycle Finding |

11056 | Fetching from uHunt | 6.3i, String Comparison |

11057 | Fetching from uHunt | 3.3a, Binary Search |

11060 | Fetching from uHunt | 4.2d, Topological Sort |

11069 | Fetching from uHunt | 5.4e, Others, Harder |

11070 | Fetching from uHunt | 6.3e, Recursive Parsing |

11076 | Fetching from uHunt | 5.5c, Factorial |

11080 | Fetching from uHunt | 4.2e, Bipartite Graph |

11095 | Fetching from uHunt | 8.4b, NP-hard/C, small, Harder |

11096 | Fetching from uHunt | 7.3a, Polygon, Easier |

11105 | Fetching from uHunt | 8.5b, Other and DP 1D RSQ/RMQ |

11111 | Fetching from uHunt | 9.brac, Bracket Matching |

11121 | Fetching from uHunt | 5.2i, Base Number Variants |

11125 | Fetching from uHunt | 8.3d, Counting Paths, Harder |

11130 | Fetching from uHunt | 5.2b, Math Simulation, Harder |

11136 | Fetching from uHunt | 2.3e, Balanced BST (set) |

11138 | Fetching from uHunt | 4.8e, Bipartite Graph |

11147 | Fetching from uHunt | 3.3c, Other DnC Problems |

11163 | Fetching from uHunt | 9.asta, A* or IDA* |

11167 | Fetching from uHunt | 4.6a, Network Flow, Standard |

11172 | Fetching from uHunt | 1.3b, Selection Only |

11176 | Fetching from uHunt | 5.6b, Probability, Harder |

11181 | Fetching from uHunt | 5.6a, Probability, Easier |

11198 | Fetching from uHunt | 8.2c, State-Space, BFS, Harder |

11203 | Fetching from uHunt | 6.3c, Frequency Counting |

11212 | Fetching from uHunt | 8.2c, State-Space, BFS, Harder |

11227 | Fetching from uHunt | 8.5f, Geometry and Other |

11228 | Fetching from uHunt | 4.3a, MST, Standard |

11231 | Fetching from uHunt | 5.2d, Finding Pattern, Harder |

11236 | Fetching from uHunt | 3.2d, Three+ Nested Loops, Harder |

11241 | Fetching from uHunt | 5.2k, Just Ad Hoc |

11254 | Fetching from uHunt | 5.2b, Math Simulation, Harder |

11258 | Fetching from uHunt | 6.5b, DP String, Non Classic |

11259 | Fetching from uHunt | 3.5d, Coin-Change |

11264 | Fetching from uHunt | 3.4a, Greedy (Classical) |

11265 | Fetching from uHunt | 7.3b, Polygon, Harder |

11278 | Fetching from uHunt | 6.3a, Cipher, Easier |

11279 | Fetching from uHunt | 1.4f, Real Life, Harder |

11280 | Fetching from uHunt | 4.4e, SSSP, -ve weight |

11281 | Fetching from uHunt | 7.2e, Triangles + Circles |

11283 | Fetching from uHunt | 6.4b, String Matching, 2D Grid |

11287 | Fetching from uHunt | 5.3b, (Prob) Prime Testing |

11288 | Fetching from uHunt | 8.5h, Three Components |

11291 | Fetching from uHunt | 6.3e, Recursive Parsing |

11308 | Fetching from uHunt | 2.3f, Balanced BST (map) |

11310 | Fetching from uHunt | 5.4d, Others, Easier |

11311 | Fetching from uHunt | 5.8a, Game Theory |

11324 | Fetching from uHunt | 8.5c, Graph and DP |

11326 | Fetching from uHunt | 7.2d, Triangles (Trigonometry) |

11329 | Fetching from uHunt | 8.2c, State-Space, BFS, Harder |

11331 | Fetching from uHunt | 8.5c, Graph and DP |

11332 | Fetching from uHunt | 1.3e, Function |

11340 | Fetching from uHunt | 2.3b, Direct Addressing Table |

11344 | Fetching from uHunt | 5.5j, Other Number Theory |

11347 | Fetching from uHunt | 5.5e, Prime Factors Related |

11351 | Fetching from uHunt | 9.jose, Josephus Problem |

11352 | Fetching from uHunt | 4.4b, SSSP, BFS, Harder |

11353 | Fetching from uHunt | 5.5f, Prime Factors Functions |

11356 | Fetching from uHunt | 1.4g, Time, Easier |

11357 | Fetching from uHunt | 8.4c, NP-hard/C, special, Easier |

11361 | Fetching from uHunt | 6.5b, DP String, Non Classic |

11369 | Fetching from uHunt | 3.4b, Involving Sorting, Easier |

11371 | Fetching from uHunt | 5.5j, Other Number Theory |

11375 | Fetching from uHunt | 8.3d, Counting Paths, Harder |

11378 | Fetching from uHunt | 9.clos, Closest Pair Problem |

11385 | Fetching from uHunt | 6.3b, Cipher, Harder |

11388 | Fetching from uHunt | 5.5b, GCD and/or LCM |

11395 | Fetching from uHunt | 5.5e, Prime Factors Related |

11396 | Fetching from uHunt | 4.2e, Bipartite Graph |

11401 | Fetching from uHunt | 5.4d, Others, Easier |

11402 | Fetching from uHunt | 2.4c, Tree-related DS |

11403 | Fetching from uHunt | 6.3h, Output Formatting, Harder |

11404 | Fetching from uHunt | 9.palb, Palindrome (Generating) |

11417 | Fetching from uHunt | 5.5b, GCD and/or LCM |

11418 | Fetching from uHunt | 4.6a, Network Flow, Standard |

11420 | Fetching from uHunt | 3.5f, DP level 1 |

11423 | Fetching from uHunt | 2.4c, Tree-related DS |

11426 | Fetching from uHunt | 5.5g, Modified Sieve |

11432 | Fetching from uHunt | 8.3d, Counting Paths, Harder |

11447 | Fetching from uHunt | 7.3a, Polygon, Easier |

11451 | Fetching from uHunt | 8.2a, Challenging Backtracking |

11459 | Fetching from uHunt | 1.4c, Game (Others), Easier |

11463 | Fetching from uHunt | 4.5a, APSP, Standard |

11466 | Fetching from uHunt | 5.5d, Finding Prime Factors |

11473 | Fetching from uHunt | 7.3a, Polygon, Easier |

11474 | Fetching from uHunt | 8.5g, Efficient DS and Other |

11483 | Fetching from uHunt | 6.3j, Ad Hoc String |

11489 | Fetching from uHunt | 5.8a, Game Theory |

11490 | Fetching from uHunt | 5.2b, Math Simulation, Harder |

11491 | Fetching from uHunt | 3.4e, Non Classical, Harder |

11495 | Fetching from uHunt | 9.inve, Inversion Index |

11507 | Fetching from uHunt | 1.3h, Medium |

11511 | Fetching from uHunt | 5.7a, Cycle Finding |

11512 | Fetching from uHunt | 6.6a, Suffix Trie/Tree/Array |

11513 | Fetching from uHunt | 8.2b, State-Space, BFS, Easier |

11520 | Fetching from uHunt | 3.4d, Non Classical, Easier |

11525 | Fetching from uHunt | 8.5g, Efficient DS and Other |

11526 | Fetching from uHunt | 5.2k, Just Ad Hoc |

11538 | Fetching from uHunt | 5.4e, Others, Harder |

11547 | Fetching from uHunt | 1.3c, Repetition Only |

11550 | Fetching from uHunt | 2.4a, Graph Data Structures |

11552 | Fetching from uHunt | 6.5b, DP String, Non Classic |

11553 | Fetching from uHunt | 9.kuhn, Kuhn Munkres's Algorithm |

11559 | Fetching from uHunt | 1.3g, Still Easy |

11566 | Fetching from uHunt | 3.5c, 0-1 Knapsack |

11569 | Fetching from uHunt | 4.8b, Counting Paths, Easier |

11574 | Fetching from uHunt | 8.5f, Geometry and Other |

11581 | Fetching from uHunt | 2.2b, 2D Array Manipulation |

11582 | Fetching from uHunt | 5.9a, Matrix Power |

11583 | Fetching from uHunt | 3.4e, Non Classical, Harder |

11584 | Fetching from uHunt | 9.pala, Palindrome (Checking) |

11585 | Fetching from uHunt | 4.2c, Flood Fill, Harder |

11597 | Fetching from uHunt | 5.4d, Others, Easier |

11621 | Fetching from uHunt | 3.3a, Binary Search |

11628 | Fetching from uHunt | 5.6b, Probability, Harder |

11629 | Fetching from uHunt | 2.3d, Hash Table (map) |

11631 | Fetching from uHunt | 4.3a, MST, Standard |

11636 | Fetching from uHunt | 5.2g, Log, Exp, Pow |

11638 | Fetching from uHunt | 1.4i, Time Waster |

11643 | Fetching from uHunt | 9.knig, Knight Moves |

11659 | Fetching from uHunt | 3.2f, Iterative (Combination) |

11678 | Fetching from uHunt | 1.4a, Game (Card) |

11683 | Fetching from uHunt | 1.3g, Still Easy |

11687 | Fetching from uHunt | 1.3e, Function |

11695 | Fetching from uHunt | 4.8d, Tree |

11699 | Fetching from uHunt | 8.2a, Challenging Backtracking |

11709 | Fetching from uHunt | 4.2g, SCCs |

11718 | Fetching from uHunt | 5.2d, Finding Pattern, Harder |

11719 | Fetching from uHunt | 9.form, Formulas or Theorems |

11728 | Fetching from uHunt | 5.5f, Prime Factors Functions |

11729 | Fetching from uHunt | 3.4b, Involving Sorting, Easier |

11730 | Fetching from uHunt | 8.5d, Graph and Other |

11734 | Fetching from uHunt | 6.3i, String Comparison |

11742 | Fetching from uHunt | 3.2e, Iterative (Permutation) |

11747 | Fetching from uHunt | 4.3a, MST, Standard |

11752 | Fetching from uHunt | 5.5a, Prime Numbers |

11757 | Fetching from uHunt | 4.6b, Network Flow, Variants |

11764 | Fetching from uHunt | 1.3d, Control Flow |

11765 | Fetching from uHunt | 4.6b, Network Flow, Variants |

11770 | Fetching from uHunt | 4.2g, SCCs |

11783 | Fetching from uHunt | 7.2b, Lines |

11786 | Fetching from uHunt | 1.3g, Still Easy |

11790 | Fetching from uHunt | 3.5b, LIS |

11792 | Fetching from uHunt | 4.4b, SSSP, BFS, Harder |

11795 | Fetching from uHunt | 3.5e, TSP |

11799 | Fetching from uHunt | 1.3f, Easy |

11800 | Fetching from uHunt | 7.2f, Quadrilaterals |

11804 | Fetching from uHunt | 3.2d, Three+ Nested Loops, Harder |

11817 | Fetching from uHunt | 9.grea, Great Circle Distance |

11821 | Fetching from uHunt | 5.3d, Bonus: Others |

11825 | Fetching from uHunt | 8.3e, DP with Bitmask |

11827 | Fetching from uHunt | 5.5b, GCD and/or LCM |

11832 | Fetching from uHunt | 3.5c, 0-1 Knapsack |

11837 | Fetching from uHunt | 6.4a, String Matching, Standard |

11838 | Fetching from uHunt | 4.2g, SCCs |

11841 | Fetching from uHunt | 4.2c, Flood Fill, Harder |

11847 | Fetching from uHunt | 5.2g, Log, Exp, Pow |

11878 | Fetching from uHunt | 6.3d, Iterative Parsing |

11879 | Fetching from uHunt | 5.3a, Big Integer, Basic |

11888 | Fetching from uHunt | 9.pala, Palindrome (Checking) |

11890 | Fetching from uHunt | 3.4e, Non Classical, Harder |

11894 | Fetching from uHunt | 7.2a, Points |

11900 | Fetching from uHunt | 3.4b, Involving Sorting, Easier |

11902 | Fetching from uHunt | 4.2a, Just Graph Traversal |

11906 | Fetching from uHunt | 4.2a, Just Graph Traversal |

11909 | Fetching from uHunt | 7.2d, Triangles (Trigonometry) |

11933 | Fetching from uHunt | 2.2e, Bit Manipulation |

11947 | Fetching from uHunt | 1.4h, Time, Harder |

11952 | Fetching from uHunt | 5.3c, Bonus: Base Number |

11953 | Fetching from uHunt | 4.2b, Flood Fill, Easier |

11955 | Fetching from uHunt | 5.4b, Binomial Coefficients |

11957 | Fetching from uHunt | 4.8b, Counting Paths, Easier |

11960 | Fetching from uHunt | 8.5g, Efficient DS and Other |

11967 | Fetching from uHunt | 8.5g, Efficient DS and Other |

11970 | Fetching from uHunt | 5.2f, Number Systems/Sequences |

11988 | Fetching from uHunt | 2.2g, List/Queue/Deque |

11991 | Fetching from uHunt | 2.4a, Graph Data Structures |

11997 | Fetching from uHunt | 2.3a, Priority Queue |

12004 | Fetching from uHunt | 5.2c, Finding Pattern, Easier |

12032 | Fetching from uHunt | 3.3b, Binary Search the Answer |

12036 | Fetching from uHunt | 5.2k, Just Ad Hoc |

12043 | Fetching from uHunt | 5.5g, Modified Sieve |

12047 | Fetching from uHunt | 4.4d, SSSP, Dijkstra, Harder |

12049 | Fetching from uHunt | 2.3c, Hash Table (set) |

12068 | Fetching from uHunt | 5.2j, Fractions |

12085 | Fetching from uHunt | 1.4i, Time Waster |

12108 | Fetching from uHunt | 2.2g, List/Queue/Deque |

12125 | Fetching from uHunt | 4.6b, Network Flow, Variants |

12135 | Fetching from uHunt | 8.2b, State-Space, BFS, Easier |

12136 | Fetching from uHunt | 1.4g, Time, Easier |

12148 | Fetching from uHunt | 1.4g, Time, Easier |

12155 | Fetching from uHunt | 6.3h, Output Formatting, Harder |

12157 | Fetching from uHunt | 1.3h, Medium |

12160 | Fetching from uHunt | 4.4a, SSSP, BFS, Easier |

12190 | Fetching from uHunt | 3.3b, Binary Search the Answer |

12192 | Fetching from uHunt | 3.3a, Binary Search |

12218 | Fetching from uHunt | 8.5e, Maths and Other |

12238 | Fetching from uHunt | 9.lowe, Lowest Common Ancestor |

12247 | Fetching from uHunt | 1.4a, Game (Card) |

12249 | Fetching from uHunt | 3.2e, Iterative (Permutation) |

12250 | Fetching from uHunt | 1.3b, Selection Only |

12256 | Fetching from uHunt | 7.2f, Quadrilaterals |

12279 | Fetching from uHunt | 1.3d, Control Flow |

12280 | Fetching from uHunt | 1.4i, Time Waster |

12291 | Fetching from uHunt | 2.2b, 2D Array Manipulation |

12299 | Fetching from uHunt | 2.4c, Tree-related DS |

12321 | Fetching from uHunt | 3.4a, Greedy (Classical) |

12322 | Fetching from uHunt | 8.5f, Geometry and Other |

12324 | Fetching from uHunt | 8.3a, DP level 2 |

12335 | Fetching from uHunt | 5.5c, Factorial |

12356 | Fetching from uHunt | 2.2a, 1D Array Manipulation |

12363 | Fetching from uHunt | 4.2f, Articulation Points/Bridges |

12364 | Fetching from uHunt | 6.3g, Output Formatting, Easier |

12372 | Fetching from uHunt | 1.3b, Selection Only |

12379 | Fetching from uHunt | 4.8d, Tree |

12397 | Fetching from uHunt | 9.roma, Roman Numerals |

12416 | Fetching from uHunt | 5.2g, Log, Exp, Pow |

12442 | Fetching from uHunt | 4.2a, Just Graph Traversal |

12445 | Fetching from uHunt | 8.2c, State-Space, BFS, Harder |

12455 | Fetching from uHunt | 8.4a, NP-hard/C, small, Easier |

12463 | Fetching from uHunt | 5.4d, Others, Easier |

12467 | Fetching from uHunt | 6.4a, String Matching, Standard |

12478 | Fetching from uHunt | 1.3a, I/O + Sequence Only |

12482 | Fetching from uHunt | 3.4d, Non Classical, Easier |

12488 | Fetching from uHunt | 3.2b, Iterative (Two Nested Loops) |

12503 | Fetching from uHunt | 1.3f, Easy |

12504 | Fetching from uHunt | 2.3f, Balanced BST (map) |

12541 | Fetching from uHunt | 2.2c, Sorting, Easier |

12571 | Fetching from uHunt | 2.2e, Bit Manipulation |

12614 | Fetching from uHunt | 1.3g, Still Easy |

12641 | Fetching from uHunt | 9.anag, Anagram |

12643 | Fetching from uHunt | 1.3h, Medium |

12644 | Fetching from uHunt | 4.8e, Bipartite Graph |

12650 | Fetching from uHunt | 2.3b, Direct Addressing Table |

12662 | Fetching from uHunt | 2.2a, 1D Array Manipulation |

12667 | Fetching from uHunt | 2.2b, 2D Array Manipulation |

12668 | Fetching from uHunt | 4.8e, Bipartite Graph |

12673 | Fetching from uHunt | 3.4c, Involving Sorting, Harder |

12694 | Fetching from uHunt | 3.2f, Iterative (Combination) |

12696 | Fetching from uHunt | 1.3f, Easy |

12703 | Fetching from uHunt | 5.5d, Finding Prime Factors |

12709 | Fetching from uHunt | 2.2c, Sorting, Easier |

12712 | Fetching from uHunt | 5.4b, Binomial Coefficients |

12718 | Fetching from uHunt | 9.palb, Palindrome (Generating) |

12720 | Fetching from uHunt | 2.2e, Bit Manipulation |

12747 | Fetching from uHunt | 6.5a, DP String, Classic |

12770 | Fetching from uHunt | 9.anag, Anagram |

12783 | Fetching from uHunt | 4.2f, Articulation Points/Bridges |

12786 | Fetching from uHunt | 9.form, Formulas or Theorems |

12791 | Fetching from uHunt | 3.3b, Binary Search the Answer |

12796 | Fetching from uHunt | 5.9a, Matrix Power |

12797 | Fetching from uHunt | 8.5d, Graph and Other |

12805 | Fetching from uHunt | 5.5d, Finding Prime Factors |

12820 | Fetching from uHunt | 6.3c, Frequency Counting |

12822 | Fetching from uHunt | 1.4h, Time, Harder |

12826 | Fetching from uHunt | 4.4b, SSSP, BFS, Harder |

12834 | Fetching from uHunt | 3.4c, Involving Sorting, Harder |

12840 | Fetching from uHunt | 3.2h, Backtracking (Easier) |

12841 | Fetching from uHunt | 3.5e, TSP |

12844 | Fetching from uHunt | 3.2c, Three+ Nested Loops, Easier |

12862 | Fetching from uHunt | 8.3a, DP level 2 |

12869 | Fetching from uHunt | 5.5c, Factorial |

12873 | Fetching from uHunt | 4.6a, Network Flow, Standard |

12875 | Fetching from uHunt | 4.8c, Conversion to DAG |

12893 | Fetching from uHunt | 3.3c, Other DnC Problems |

12896 | Fetching from uHunt | 6.3a, Cipher, Easier |

12904 | Fetching from uHunt | 3.2c, Three+ Nested Loops, Easier |

12911 | Fetching from uHunt | 8.4b, NP-hard/C, small, Harder |

12916 | Fetching from uHunt | 6.3j, Ad Hoc String |

12918 | Fetching from uHunt | 5.2c, Finding Pattern, Easier |

12930 | Fetching from uHunt | 5.3d, Bonus: Others |

12950 | Fetching from uHunt | 4.4d, SSSP, Dijkstra, Harder |

12955 | Fetching from uHunt | 8.3a, DP level 2 |

12965 | Fetching from uHunt | 2.2d, Sorting, Harder |

13025 | Fetching from uHunt | 1.3a, I/O + Sequence Only |

13037 | Fetching from uHunt | 2.3e, Balanced BST (set) |

13054 | Fetching from uHunt | 3.4c, Involving Sorting, Harder |

13055 | Fetching from uHunt | 2.2f, Stack |

13108 | Fetching from uHunt | 9.form, Formulas or Theorems |

13109 | Fetching from uHunt | 3.4b, Involving Sorting, Easier |

13115 | Fetching from uHunt | 8.4c, NP-hard/C, special, Easier |

13117 | Fetching from uHunt | 7.2b, Lines |

13127 | Fetching from uHunt | 4.4c, SSSP, Dijkstra, Easier |

13141 | Fetching from uHunt | 3.5f, DP level 1 |

13142 | Fetching from uHunt | 3.3b, Binary Search the Answer |

13145 | Fetching from uHunt | 6.3a, Cipher, Easier |

13146 | Fetching from uHunt | 6.5a, DP String, Classic |

13148 | Fetching from uHunt | 2.3c, Hash Table (set) |

13177 | Fetching from uHunt | 2.3a, Priority Queue |

13181 | Fetching from uHunt | 2.2a, 1D Array Manipulation |

13190 | Fetching from uHunt | 2.3a, Priority Queue |

13212 | Fetching from uHunt | 9.inve, Inversion Index |

13215 | Fetching from uHunt | 7.2e, Triangles + Circles |

2048 | Kattis - 2048 | 2.2b, 2D Array Manipulation |

4thought | Kattis - 4thought | 3.2a, Pre-calculate-able |

a1paper | Kattis - a1paper | 3.3c, Other DnC Problems |

abinitio | Kattis - abinitio | 2.4a, Graph Data Structures |

acm | Kattis - acm | 1.3d, Control Flow |

acm2 | Kattis - acm2 | 3.4b, Involving Sorting, Easier |

ada | Kattis - ada | 5.2h, Polynomial |

adjoin | Kattis - adjoin | 4.8d, Tree |

administrativeproblems | Kattis - administrativeproblems | 2.3f, Balanced BST (map) |

airconditioned | Kattis - airconditioned | 3.4c, Involving Sorting, Harder |

airlinehub | Kattis - airlinehub | 9.grea, Great Circle Distance |

aliennumbers | Kattis - aliennumbers | 5.2i, Base Number Variants |

allaboutthatbase | Kattis - allaboutthatbase | 5.3c, Bonus: Base Number |

alldifferentdirections | Kattis - alldifferentdirections | 7.2d, Triangles (Trigonometry) |

allpairspath | Kattis - allpairspath | 4.5a, APSP, Standard |

almostperfect | Kattis - almostperfect | 5.5f, Prime Factors Functions |

almostunionfind | Kattis - almostunionfind | 2.4b, Union-Find Disjoint Sets |

anagramcounting | Kattis - anagramcounting | 5.4e, Others, Harder |

anewalphabet | Kattis - anewalphabet | 6.3a, Cipher, Easier |

animal | Kattis - animal | 8.5g, Efficient DS and Other |

anothercandies | Kattis - anothercandies | 5.5h, Modulo Arithmetic |

anti11 | Kattis - anti11 | 5.4a, Fibonacci Numbers |

ants | Kattis - ants | 3.4d, Non Classical, Easier |

apaxiaaans | Kattis - apaxiaaans | 6.3f, Regular Expression |

aqueducts | Kattis - aqueducts | 9.kuhn, Kuhn Munkres's Algorithm |

arbitrage | Kattis - arbitrage | 4.5b, APSP, Variants |

arithmetic | Kattis - arithmetic | 5.2i, Base Number Variants |

armystrengthhard | Kattis - armystrengthhard | 1.3f, Easy |

artichoke | Kattis - artichoke | 1.3e, Function |

asciifigurerotation | Kattis - asciifigurerotation | 6.3h, Output Formatting, Harder |

aspenavenue | Kattis - aspenavenue | 8.3b, DP level 3 |

autori | Kattis - autori | 6.3d, Iterative Parsing |

averageshard | Kattis - averageshard | 5.2c, Finding Pattern, Easier |

avoidingtheapocalypse | Kattis - avoidingtheapocalypse | 4.6b, Network Flow, Variants |

bachetsgame | Kattis - bachetsgame | 5.8a, Game Theory |

ballotboxes | Kattis - ballotboxes | 2.3a, Priority Queue |

baloni | Kattis - baloni | 2.2a, 1D Array Manipulation |

bank | Kattis - bank | 3.4d, Non Classical, Easier |

basicinterpreter | Kattis - basicinterpreter | 2.3d, Hash Table (map) |

basicremains | Kattis - basicremains | 5.3c, Bonus: Base Number |

batmanacci | Kattis - batmanacci | 5.4a, Fibonacci Numbers |

batteries | Kattis - batteries | 9.eggd, Egg Dropping Puzzle |

batterup | Kattis - batterup | 1.3f, Easy |

battleship | Kattis - battleship | 1.4d, Game (Others), Harder |

battlesimulation | Kattis - battlesimulation | 1.3h, Medium |

beanbag | Kattis - beanbag | 8.4b, NP-hard/C, small, Harder |

beavergnaw | Kattis - beavergnaw | 9.3dge, 3D Geometry |

beehives | Kattis - beehives | 8.5f, Geometry and Other |

beehouseperimeter | Kattis - beehouseperimeter | 5.2e, Grid |

beepers | Kattis - beepers | 3.5e, TSP |

bela | Kattis - bela | 1.4a, Game (Card) |

biggest | Kattis - biggest | 7.2c, Circles |

bigtruck | Kattis - bigtruck | 8.2d, State-Space, Dijkstra |

bilateral | Kattis - bilateral | 8.4c, NP-hard/C, special, Easier |

billiard | Kattis - billiard | 7.2d, Triangles (Trigonometry) |

birds | Kattis - birds | 3.4c, Involving Sorting, Harder |

birthday | Kattis - birthday | 4.2f, Articulation Points/Bridges |

bishops | Kattis - bishops | 5.2c, Finding Pattern, Easier |

bitbybit | Kattis - bitbybit | 2.2e, Bit Manipulation |

bitsequalizer | Kattis - bitsequalizer | 1.3h, Medium |

blockcrusher | Kattis - blockcrusher | 4.4d, SSSP, Dijkstra, Harder |

blockgame2 | Kattis - blockgame2 | 5.8a, Game Theory |

bobby | Kattis - bobby | 5.6b, Probability, Harder |

boggle | Kattis - boggle | 6.4b, String Matching, 2D Grid |

bookclub | Kattis - bookclub | 4.8e, Bipartite Graph |

bookingaroom | Kattis - bookingaroom | 2.3b, Direct Addressing Table |

bossbattle | Kattis - bossbattle | 1.3g, Still Easy |

bottles | Kattis - bottles | 9.3dge, 3D Geometry |

bread | Kattis - bread | 9.inve, Inversion Index |

breakingbad | Kattis - breakingbad | 4.2e, Bipartite Graph |

brexit | Kattis - brexit | 4.2d, Topological Sort |

browniepoints | Kattis - browniepoints | 7.2a, Points |

bst | Kattis - bst | 2.3e, Balanced BST (set) |

builddeps | Kattis - builddeps | 4.2d, Topological Sort |

bumped | Kattis - bumped | 8.2d, State-Space, Dijkstra |

busnumbers2 | Kattis - busnumbers2 | 8.5g, Efficient DS and Other |

bustour | Kattis - bustour | 3.5e, TSP |

busyschedule | Kattis - busyschedule | 1.4h, Time, Harder |

buttonbashing | Kattis - buttonbashing | 4.4a, SSSP, BFS, Easier |

buzzwords | Kattis - buzzwords | 6.6a, Suffix Trie/Tree/Array |

calculatingdartscores | Kattis - calculatingdartscores | 3.2d, Three+ Nested Loops, Harder |

calculator | Kattis - calculator | 6.3e, Recursive Parsing |

candlebox | Kattis - candlebox | 5.2f, Number Systems/Sequences |

candydistribution | Kattis - candydistribution | 5.5i, Extended Euclid |

candydivision | Kattis - candydivision | 2.3e, Balanced BST (set) |

canonical | Kattis - canonical | 3.5d, Coin-Change |

cantinaofbabel | Kattis - cantinaofbabel | 4.2g, SCCs |

cantor | Kattis - cantor | 9.tern, Ternary Search |

cardmagic | Kattis - cardmagic | 4.8c, Conversion to DAG |

cardtrick2 | Kattis - cardtrick2 | 3.2a, Pre-calculate-able |

carrots | Kattis - carrots | 1.3a, I/O + Sequence Only |

catalan | Kattis - catalan | 5.4c, Catalan Numbers |

catalansquare | Kattis - catalansquare | 5.4c, Catalan Numbers |

catenyms | Kattis - catenyms | 4.8f, Eulerian Graph |

cats | Kattis - cats | 4.3a, MST, Standard |

caveexploration | Kattis - caveexploration | 4.2f, Articulation Points/Bridges |

cd | Kattis - cd | 2.3c, Hash Table (set) |

ceiling | Kattis - ceiling | 3.3c, Other DnC Problems |

centsavings | Kattis - centsavings | 8.5b, Other and DP 1D RSQ/RMQ |

character | Kattis - character | 5.4d, Others, Easier |

charlesincharge | Kattis - charlesincharge | 8.5a, Bsearch-ans and Others |

checkingforcorrectness | Kattis - checkingforcorrectness | 5.9a, Matrix Power |

chess | Kattis - chess | 1.4b, Game (Chess) |

chewbacca | Kattis - chewbacca | 9.lowe, Lowest Common Ancestor |

chopin | Kattis - chopin | 1.4e, Real Life, Easier |

chopwood | Kattis - chopwood | 2.4a, Graph Data Structures |

classrooms | Kattis - classrooms | 3.4a, Greedy (Classical) |

classy | Kattis - classy | 2.2d, Sorting, Harder |

closestpair1 | Kattis - closestpair1 | 9.clos, Closest Pair Problem |

closestsums | Kattis - closestsums | 3.2b, Iterative (Two Nested Loops) |

coast | Kattis - coast | 4.2c, Flood Fill, Harder |

coke | Kattis - coke | 8.3c, DP level 4 |

cokolada | Kattis - cokolada | 5.2g, Log, Exp, Pow |

collatz | Kattis - collatz | 5.2f, Number Systems/Sequences |

coloring | Kattis - coloring | 8.4b, NP-hard/C, small, Harder |

combinationlock | Kattis - combinationlock | 1.3e, Function |

commercials | Kattis - commercials | 3.5a, Max 1D/2D Range Sum |

committeeassignment | Kattis - committeeassignment | 8.2a, Challenging Backtracking |

communication | Kattis - communication | 3.2g, Try All Possible Answers |

compass | Kattis - compass | 1.4e, Real Life, Easier |

compoundwords | Kattis - compoundwords | 2.3e, Balanced BST (set) |

conformity | Kattis - conformity | 2.3d, Hash Table (map) |

connectthedots | Kattis - connectthedots | 1.4c, Game (Others), Easier |

consecutivesums | Kattis - consecutivesums | 5.5e, Prime Factors Related |

conservation | Kattis - conservation | 4.2d, Topological Sort |

control | Kattis - control | 2.4b, Union-Find Disjoint Sets |

conundrum | Kattis - conundrum | 6.3a, Cipher, Easier |

convex | Kattis - convex | 7.3b, Polygon, Harder |

convexhull | Kattis - convexhull | 7.3a, Polygon, Easier |

cool1 | Kattis - cool1 | 5.7a, Cycle Finding |

countcircuits | Kattis - countcircuits | 8.3d, Counting Paths, Harder |

crackingrsa | Kattis - crackingrsa | 5.2b, Math Simulation, Harder |

creditcard | Kattis - creditcard | 1.4f, Real Life, Harder |

crne | Kattis - crne | 5.2c, Finding Pattern, Easier |

cropeasy | Kattis - cropeasy | 7.2e, Triangles + Circles |

crosscountry | Kattis - crosscountry | 4.4e, SSSP, -ve weight |

cudoviste | Kattis - cudoviste | 3.2c, Three+ Nested Loops, Easier |

cups | Kattis - cups | 2.2c, Sorting, Easier |

cursethedarkness | Kattis - cursethedarkness | 7.2a, Points |

cuttingcorners | Kattis - cuttingcorners | 7.3a, Polygon, Easier |

cycleseasy | Kattis - cycleseasy | 3.5e, TSP |

dancerecital | Kattis - dancerecital | 3.2e, Iterative (Permutation) |

data | Kattis - data | 5.5g, Modified Sieve |

deadfraction | Kattis - deadfraction | 5.2j, Fractions |

deathstar | Kattis - deathstar | 2.2e, Bit Manipulation |

delimitersoup | Kattis - delimitersoup | 9.brac, Bracket Matching |

delivery | Kattis - delivery | 3.4c, Involving Sorting, Harder |

destinationunknown | Kattis - destinationunknown | 8.2d, State-Space, Dijkstra |

dicegame | Kattis - dicegame | 5.6a, Probability, Easier |

different | Kattis - different | 1.3b, Selection Only |

digitsum | Kattis - digitsum | 5.2d, Finding Pattern, Harder |

display | Kattis - display | 6.3g, Output Formatting, Easier |

divisibility | Kattis - divisibility | 5.5j, Other Number Theory |

divisors | Kattis - divisors | 5.5f, Prime Factors Functions |

dobra | Kattis - dobra | 3.2i, Backtracking (Harder) |

dominoes2 | Kattis - dominoes2 | 4.2b, Flood Fill, Easier |

dominos | Kattis - dominos | 4.2g, SCCs |

downtime | Kattis - downtime | 2.2a, 1D Array Manipulation |

drinkresponsibly | Kattis - drinkresponsibly | 8.3c, DP level 4 |

dst | Kattis - dst | 1.4h, Time, Harder |

dunglish | Kattis - dunglish | 8.5e, Maths and Other |

dvaput | Kattis - dvaput | 6.6a, Suffix Trie/Tree/Array |

dvds | Kattis - dvds | 3.4e, Non Classical, Harder |

dvoniz | Kattis - dvoniz | 8.5b, Other and DP 1D RSQ/RMQ |

dyslectionary | Kattis - dyslectionary | 2.2d, Sorting, Harder |

easiest | Kattis - easiest | 5.2a, Math Simulation, Easier |

ecoins | Kattis - ecoins | 8.2b, State-Space, BFS, Easier |

egypt | Kattis - egypt | 7.2d, Triangles (Trigonometry) |

election | Kattis - election | 5.4b, Binomial Coefficients |

elementarymath | Kattis - elementarymath | 4.8e, Bipartite Graph |

elevatortrouble | Kattis - elevatortrouble | 8.2b, State-Space, BFS, Easier |

eligibility | Kattis - eligibility | 1.3b, Selection Only |

empleh | Kattis - empleh | 1.4b, Game (Chess) |

emptyingbaltic | Kattis - emptyingbaltic | 4.4d, SSSP, Dijkstra, Harder |

encodedmessage | Kattis - encodedmessage | 6.3a, Cipher, Easier |

engaging | Kattis - engaging | 9.kuhn, Kuhn Munkres's Algorithm |

enlarginghashtables | Kattis - enlarginghashtables | 5.5a, Prime Numbers |

enviousexponents | Kattis - enviousexponents | 8.5h, Three Components |

equalsumseasy | Kattis - equalsumseasy | 8.4a, NP-hard/C, small, Easier |

equivalences | Kattis - equivalences | 4.2g, SCCs |

errands | Kattis - errands | 3.5e, TSP |

escapeplan | Kattis - escapeplan | 4.8e, Bipartite Graph |

esej | Kattis - esej | 2.3c, Hash Table (set) |

espressobucks | Kattis - espressobucks | 9.cons, Construction Problem |

euclideantsp | Kattis - euclideantsp | 9.tern, Ternary Search |

euclidsgame | Kattis - euclidsgame | 5.8a, Game Theory |

eulerianpath | Kattis - eulerianpath | 4.8f, Eulerian Graph |

europeantrip | Kattis - europeantrip | 8.4c, NP-hard/C, special, Easier |

evenup | Kattis - evenup | 2.2f, Stack |

everywhere | Kattis - everywhere | 2.3c, Hash Table (set) |

exactchange2 | Kattis - exactchange2 | 3.5d, Coin-Change |

exam | Kattis - exam | 6.5b, DP String, Non Classic |

factovisors | Kattis - factovisors | 5.5e, Prime Factors Related |

factstone | Kattis - factstone | 5.2g, Log, Exp, Pow |

faktor | Kattis - faktor | 1.3a, I/O + Sequence Only |

falling | Kattis - falling | 5.2b, Math Simulation, Harder |

farey | Kattis - farey | 5.5g, Modified Sieve |

fastfood | Kattis - fastfood | 1.3h, Medium |

faultyrobot | Kattis - faultyrobot | 4.2a, Just Graph Traversal |

favourable | Kattis - favourable | 8.3d, Counting Paths, Harder |

fenwick | Kattis - fenwick | 2.4c, Tree-related DS |

fiat | Kattis - fiat | 5.4c, Catalan Numbers |

fire2 | Kattis - fire2 | 4.4b, SSSP, BFS, Harder |

firefly | Kattis - firefly | 3.3a, Binary Search |

fizzbuzz | Kattis - fizzbuzz | 5.5j, Other Number Theory |

flexible | Kattis - flexible | 3.2g, Try All Possible Answers |

flowergarden | Kattis - flowergarden | 5.3b, (Prob) Prime Testing |

flowerytrails | Kattis - flowerytrails | 4.4c, SSSP, Dijkstra, Easier |

flowfree | Kattis - flowfree | 8.4a, NP-hard/C, small, Easier |

flowshop | Kattis - flowshop | 2.2b, 2D Array Manipulation |

font | Kattis - font | 8.4a, NP-hard/C, small, Easier |

fraction | Kattis - fraction | 5.2j, Fractions |

freeweights | Kattis - freeweights | 3.3b, Binary Search the Answer |

friday | Kattis - friday | 1.4g, Time, Easier |

froshweek | Kattis - froshweek | 9.inve, Inversion Index |

froshweek2 | Kattis - froshweek2 | 3.4a, Greedy (Classical) |

fruitbaskets | Kattis - fruitbaskets | 3.2i, Backtracking (Harder) |

fundamentalneighbors | Kattis - fundamentalneighbors | 5.5e, Prime Factors Related |

funhouse | Kattis - funhouse | 2.2b, 2D Array Manipulation |

gamerank | Kattis - gamerank | 1.4c, Game (Others), Easier |

gears2 | Kattis - gears2 | 8.5d, Graph and Other |

geneticsearch | Kattis - geneticsearch | 6.4a, String Matching, Standard |

geppetto | Kattis - geppetto | 3.2e, Iterative (Permutation) |

getshorty | Kattis - getshorty | 4.4c, SSSP, Dijkstra, Easier |

gettingthrough | Kattis - gettingthrough | 8.5h, Three Components |

goldbach2 | Kattis - goldbach2 | 5.3b, (Prob) Prime Testing |

golombrulers | Kattis - golombrulers | 3.2b, Iterative (Two Nested Loops) |

goodcoalition | Kattis - goodcoalition | 5.6b, Probability, Harder |

goodmorning | Kattis - goodmorning | 3.2h, Backtracking (Easier) |

grandpabernie | Kattis - grandpabernie | 2.3d, Hash Table (map) |

grasshopper | Kattis - grasshopper | 9.knig, Knight Moves |

greetingcard | Kattis - greetingcard | 2.3c, Hash Table (set) |

grid | Kattis - grid | 4.4a, SSSP, BFS, Easier |

gridmst | Kattis - gridmst | 8.5d, Graph and Other |

grille | Kattis - grille | 6.3b, Cipher, Harder |

growlinggears | Kattis - growlinggears | 5.2a, Math Simulation, Easier |

guess | Kattis - guess | 3.3a, Binary Search |

guessinggame | Kattis - guessinggame | 1.4c, Game (Others), Easier |

happyprime | Kattis - happyprime | 5.7a, Cycle Finding |

hardware | Kattis - hardware | 2.3b, Direct Addressing Table |

hardwoodspecies | Kattis - hardwoodspecies | 2.3f, Balanced BST (map) |

heliocentric | Kattis - heliocentric | 5.5i, Extended Euclid |

hello | Kattis - hello | 1.3a, I/O + Sequence Only |

helpme | Kattis - helpme | 1.4b, Game (Chess) |

heritage | Kattis - heritage | 6.5b, DP String, Non Classic |

hidden | 6.3f, Regular Expression | |

hidingchickens | Kattis - hidingchickens | 8.3e, DP with Bitmask |

hidingplaces | Kattis - hidingplaces | 9.knig, Knight Moves |

hillnumbers | Kattis - hillnumbers | 6.5b, DP String, Non Classic |

hissingmicrophone | Kattis - hissingmicrophone | 1.3f, Easy |

holeynqueensbatman | Kattis - holeynqueensbatman | 8.2a, Challenging Backtracking |

honey | Kattis - honey | 5.4d, Others, Easier |

honeyheist | Kattis - honeyheist | 5.2e, Grid |

hoppers | Kattis - hoppers | 4.2e, Bipartite Graph |

horror | Kattis - horror | 4.4a, SSSP, BFS, Easier |

houseofcards | Kattis - houseofcards | 9.form, Formulas or Theorems |

humancannonball | Kattis - humancannonball | 8.5f, Geometry and Other |

hurricanedanger | Kattis - hurricanedanger | 7.2b, Lines |

ignore | Kattis - ignore | 5.2i, Base Number Variants |

iks | Kattis - iks | 5.5e, Prime Factors Related |

imperfectgps | Kattis - imperfectgps | 7.2a, Points |

importspaghetti | Kattis - importspaghetti | 4.5a, APSP, Standard |

incognito | Kattis - incognito | 5.4e, Others, Harder |

increasingsubsequence | Kattis - increasingsubsequence | 3.5b, LIS |

inflagrantedelicto | Kattis - inflagrantedelicto | 6.5a, DP String, Classic |

ingestion | Kattis - ingestion | 8.3b, DP level 3 |

integerlists | Kattis - integerlists | 2.2g, List/Queue/Deque |

intercept | Kattis - intercept | 4.2f, Articulation Points/Bridges |

inversefactorial | Kattis - inversefactorial | 5.5c, Factorial |

irepeatmyself | Kattis - irepeatmyself | 6.3j, Ad Hoc String |

islandhopping | Kattis - islandhopping | 4.3a, MST, Standard |

islands | Kattis - islands | 3.2g, Try All Possible Answers |

islands3 | Kattis - islands3 | 4.2c, Flood Fill, Harder |

itsasecret | Kattis - itsasecret | 6.3b, Cipher, Harder |

jackpot | Kattis - jackpot | 5.3d, Bonus: Others |

jailbreak | Kattis - jailbreak | 8.4d, NP-hard/C, special, Harder |

janitortroubles | Kattis - janitortroubles | 9.form, Formulas or Theorems |

jewelrybox | Kattis - jewelrybox | 9.tern, Ternary Search |

joinstrings | Kattis - joinstrings | 2.2g, List/Queue/Deque |

jointattack | Kattis - jointattack | 5.2j, Fractions |

jollyjumpers | Kattis - jollyjumpers | 2.2a, 1D Array Manipulation |

joylessgame | Kattis - joylessgame | 5.8a, Game Theory |

judgingmoose | Kattis - judgingmoose | 1.3b, Selection Only |

juryjeopardy | Kattis - juryjeopardy | 6.3h, Output Formatting, Harder |

justaminute | Kattis - justaminute | 1.4g, Time, Easier |

kaleidoscopicpalindromes | Kattis - kaleidoscopicpalindromes | 9.pala, Palindrome (Checking) |

karte | Kattis - karte | 1.4a, Game (Card) |

kastenlauf | Kattis - kastenlauf | 4.5b, APSP, Variants |

kattissquest | Kattis - kattissquest | 2.3f, Balanced BST (map) |

keyboard | Kattis - keyboard | 8.2c, State-Space, BFS, Harder |

kinarow | Kattis - kinarow | 6.4b, String Matching, 2D Grid |

kitten | Kattis - kitten | 4.8d, Tree |

knapsack | Kattis - knapsack | 3.5c, 0-1 Knapsack |

knightsearch | Kattis - knightsearch | 6.4b, String Matching, 2D Grid |

knightsfen | Kattis - knightsfen | 9.knig, Knight Moves |

kolone | Kattis - kolone | 6.3j, Ad Hoc String |

kutevi | Kattis - kutevi | 8.3a, DP level 2 |

ladice | Kattis - ladice | 2.4b, Union-Find Disjoint Sets |

leftbeehind | Kattis - leftbeehind | 1.3b, Selection Only |

lektira | Kattis - lektira | 3.2d, Three+ Nested Loops, Harder |

licensetolaunch | Kattis - licensetolaunch | 1.3d, Control Flow |

lindenmayorsystem | Kattis - lindenmayorsystem | 6.3f, Regular Expression |

lineup | Kattis - lineup | 2.2c, Sorting, Easier |

lockedtreasure | Kattis - lockedtreasure | 5.4b, Binomial Coefficients |

logo2 | Kattis - logo2 | 7.2b, Lines |

longincsubseq | Kattis - longincsubseq | 3.5b, LIS |

lostmap | Kattis - lostmap | 4.3a, MST, Standard |

loworderzeros | Kattis - loworderzeros | 5.5c, Factorial |

magicallights | Kattis - magicallights | 8.5g, Efficient DS and Other |

mailbox | Kattis - mailbox | 8.3b, DP level 3 |

mallmania | Kattis - mallmania | 4.4b, SSSP, BFS, Harder |

managingpackaging | Kattis - managingpackaging | 4.2d, Topological Sort |

mancala | Kattis - mancala | 3.2a, Pre-calculate-able |

maptiles2 | Kattis - maptiles2 | 5.2e, Grid |

marblestree | Kattis - marblestree | 3.4d, Non Classical, Easier |

marko | Kattis - marko | 6.3c, Frequency Counting |

matrix | Kattis - matrix | 5.2k, Just Ad Hoc |

maxflow | Kattis - maxflow | 4.6a, Network Flow, Standard |

maximizingwinnings | Kattis - maximizingwinnings | 4.8c, Conversion to DAG |

maximumrent | Kattis - maximumrent | 9.line, Linear Programming |

mazemovement | Kattis - mazemovement | 4.6a, Network Flow, Standard |

megainversions | Kattis - megainversions | 8.5e, Maths and Other |

memorymatch | Kattis - memorymatch | 1.4d, Game (Others), Harder |

mia | Kattis - mia | 1.3e, Function |

millionairemadness | Kattis - millionairemadness | 4.3b, MST, Variants |

mincut | Kattis - mincut | 4.6a, Network Flow, Standard |

minimumscalar | Kattis - minimumscalar | 3.4b, Involving Sorting, Easier |

minspantree | Kattis - minspantree | 4.3a, MST, Standard |

mixedfractions | Kattis - mixedfractions | 5.2j, Fractions |

mjehuric | Kattis - mjehuric | 2.2c, Sorting, Easier |

modulararithmetic | Kattis - modulararithmetic | 5.5i, Extended Euclid |

molekule | Kattis - molekule | 4.2e, Bipartite Graph |

mosquito | Kattis - mosquito | 1.3c, Repetition Only |

mountainbiking | Kattis - mountainbiking | 7.2d, Triangles (Trigonometry) |

moviecollection | Kattis - moviecollection | 2.4c, Tree-related DS |

mravi | Kattis - mravi | 4.8a, Shortest Paths on DAG |

mububa | Kattis - mububa | 8.3c, DP level 4 |

muddyhike | Kattis - muddyhike | 4.3b, MST, Variants |

multigram | Kattis - multigram | 9.anag, Anagram |

musicalnotation | Kattis - musicalnotation | 6.3g, Output Formatting, Easier |

musicyourway | Kattis - musicyourway | 2.2d, Sorting, Harder |

names | Kattis - names | 9.palb, Palindrome (Generating) |

namethatpermutation | Kattis - namethatpermutation | 5.5c, Factorial |

narrowartgallery | Kattis - narrowartgallery | 8.3e, DP with Bitmask |

natjecanje | Kattis - natjecanje | 3.2h, Backtracking (Easier) |

naturereserve | Kattis - naturereserve | 4.3b, MST, Variants |

neighborhoodwatch | Kattis - neighborhoodwatch | 5.2d, Finding Pattern, Harder |

nikola | Kattis - nikola | 3.5f, DP level 1 |

nine | Kattis - nine | 5.2d, Finding Pattern, Harder |

nizovi | Kattis - nizovi | 6.3h, Output Formatting, Harder |

nonprimefactors | Kattis - nonprimefactors | 5.5g, Modified Sieve |

npuzzle | Kattis - npuzzle | 3.2c, Three+ Nested Loops, Easier |

ntnuorienteering | Kattis - ntnuorienteering | 8.5c, Graph and DP |

numbertree | Kattis - numbertree | 2.3a, Priority Queue |

oceancurrents | Kattis - oceancurrents | 4.4b, SSSP, BFS, Harder |

oddbinom | Kattis - oddbinom | 5.4b, Binomial Coefficients |

oddgnome | Kattis - oddgnome | 1.3d, Control Flow |

odds | Kattis - odds | 5.6a, Probability, Easier |

officespace | Kattis - officespace | 7.2f, Quadrilaterals |

oktalni | Kattis - oktalni | 5.3c, Bonus: Base Number |

onemorebellmanford | Kattis - onemorebellmanford | 4.4e, SSSP, -ve weight |

onemorecc | Kattis - onemorecc | 3.5d, Coin-Change |

onemoredagconversion | Kattis - onemoredagconversion | 4.8c, Conversion to DAG |

ones | Kattis - ones | 5.5h, Modulo Arithmetic |

ontrack | Kattis - ontrack | 8.5e, Maths and Other |

orders | Kattis - orders | 3.5c, 0-1 Knapsack |

ornaments | Kattis - ornaments | 7.2c, Circles |

ostgotska | Kattis - ostgotska | 6.3c, Frequency Counting |

otpor | Kattis - otpor | 6.3e, Recursive Parsing |

pachinkoprobability | Kattis - pachinkoprobability | 8.3d, Counting Paths, Harder |

pachydermpeanutpacking | Kattis - pachydermpeanutpacking | 1.4i, Time Waster |

pagelayout | Kattis - pagelayout | 3.2i, Backtracking (Harder) |

paintings | Kattis - paintings | 3.2h, Backtracking (Easier) |

pairingsocks | Kattis - pairingsocks | 2.2f, Stack |

palindromesubstring | Kattis - palindromesubstring | 9.pala, Palindrome (Checking) |

pandachess | Kattis - pandachess | 6.5a, DP String, Classic |

pascal | Kattis - pascal | 5.5d, Finding Prime Factors |

password | Kattis - password | 5.6b, Probability, Harder |

peasoup | Kattis - peasoup | 1.3g, Still Easy |

pebblesolitaire | Kattis - pebblesolitaire | 8.2a, Challenging Backtracking |

pebblesolitaire2 | Kattis - pebblesolitaire2 | 8.3e, DP with Bitmask |

peragrams | Kattis - peragrams | 9.pala, Palindrome (Checking) |

perket | Kattis - perket | 3.2f, Iterative (Combination) |

permutationencryption | Kattis - permutationencryption | 6.3b, Cipher, Harder |

permutedarithmeticsequence | Kattis - permutedarithmeticsequence | 5.2f, Number Systems/Sequences |

pervasiveheartmonitor | Kattis - pervasiveheartmonitor | 6.3d, Iterative Parsing |

phonelist | Kattis - phonelist | 6.3i, String Comparison |

pivot | Kattis - pivot | 2.2a, 1D Array Manipulation |

planina | Kattis - planina | 5.4d, Others, Easier |

platforme | Kattis - platforme | 7.2b, Lines |

plot | Kattis - plot | 5.2h, Polynomial |

pointinpolygon | Kattis - pointinpolygon | 7.3b, Polygon, Harder |

pokerhand | Kattis - pokerhand | 1.3f, Easy |

polymul1 | Kattis - polymul1 | 5.2h, Polynomial |

polymul2 | Kattis - polymul2 | 9.fast, Fast Fourier Transform |

poplava | Kattis - poplava | 9.cons, Construction Problem |

porpoises | Kattis - porpoises | 5.9a, Matrix Power |

powereggs | Kattis - powereggs | 9.eggd, Egg Dropping Puzzle |

powerstrings | Kattis - powerstrings | 6.4a, String Matching, Standard |

presidentialelections | Kattis - presidentialelections | 3.5c, 0-1 Knapsack |

primalrepresentation | Kattis - primalrepresentation | 5.5d, Finding Prime Factors |

primaryarithmetic | Kattis - primaryarithmetic | 5.3a, Big Integer, Basic |

primereduction | Kattis - primereduction | 5.5d, Finding Prime Factors |

primes2 | Kattis - primes2 | 5.3b, (Prob) Prime Testing |

primesieve | Kattis - primesieve | 5.5a, Prime Numbers |

princeandprincess | Kattis - princeandprincess | 6.5a, DP String, Classic |

printingcosts | Kattis - printingcosts | 1.4i, Time Waster |

program | Kattis - program | 8.5b, Other and DP 1D RSQ/RMQ |

programmingteamselection | Kattis - programmingteamselection | 8.4b, NP-hard/C, small, Harder |

programmingtutors | Kattis - programmingtutors | 8.5a, Bsearch-ans and Others |

promotions | Kattis - promotions | 4.2a, Just Graph Traversal |

prozor | Kattis - prozor | 3.5a, Max 1D/2D Range Sum |

prsteni | Kattis - prsteni | 5.5b, GCD and/or LCM |

quickbrownfox | Kattis - quickbrownfox | 2.3b, Direct Addressing Table |

railroad2 | Kattis - railroad2 | 4.8f, Eulerian Graph |

rationalarithmetic | Kattis - rationalarithmetic | 5.5b, GCD and/or LCM |

rationalsequence | Kattis - rationalsequence | 5.2f, Number Systems/Sequences |

rats | Kattis - rats | 5.7a, Cycle Finding |

reachableroads | Kattis - reachableroads | 4.2b, Flood Fill, Easier |

reactivity | Kattis - reactivity | 8.4c, NP-hard/C, special, Easier |

recount | Kattis - recount | 2.3d, Hash Table (map) |

rectanglesurrounding | Kattis - rectanglesurrounding | 7.2f, Quadrilaterals |

reduction | Kattis - reduction | 3.2b, Iterative (Two Nested Loops) |

relatives | Kattis - relatives | 5.5f, Prime Factors Functions |

repeatingdecimal | Kattis - repeatingdecimal | 5.2b, Math Simulation, Harder |

reseto | Kattis - reseto | 5.5a, Prime Numbers |

restaurant | Kattis - restaurant | 2.2f, Stack |

rhyming | Kattis - rhyming | 6.3i, String Comparison |

ridofcoins | Kattis - ridofcoins | 8.4d, NP-hard/C, special, Harder |

rijeci | Kattis - rijeci | 5.4a, Fibonacci Numbers |

rimski | Kattis - rimski | 9.roma, Roman Numerals |

rings2 | Kattis - rings2 | 2.2b, 2D Array Manipulation |

risk | Kattis - risk | 8.5a, Bsearch-ans and Others |

roberthood | Kattis - roberthood | 7.3b, Polygon, Harder |

robotmaze | Kattis - robotmaze | 8.2c, State-Space, BFS, Harder |

robotprotection | Kattis - robotprotection | 7.3a, Polygon, Easier |

robotsonagrid | Kattis - robotsonagrid | 4.8b, Counting Paths, Easier |

robotturtles | Kattis - robotturtles | 8.2c, State-Space, BFS, Harder |

rockpaperscissors | Kattis - rockpaperscissors | 1.4d, Game (Others), Harder |

rollercoasterfun | Kattis - rollercoasterfun | 8.3c, DP level 4 |

romans | Kattis - romans | 1.3a, I/O + Sequence Only |

roompainting | Kattis - roompainting | 3.3a, Binary Search |

roundedbuttons | Kattis - roundedbuttons | 7.2f, Quadrilaterals |

runningmom | Kattis - runningmom | 4.2a, Just Graph Traversal |

runningsteps | Kattis - runningsteps | 4.8b, Counting Paths, Easier |

safe | Kattis - safe | 8.2b, State-Space, BFS, Easier |

safepassage | Kattis - safepassage | 4.8a, Shortest Paths on DAG |

savingdaylight | Kattis - savingdaylight | 1.4g, Time, Easier |

savinguniverse | Kattis - savinguniverse | 4.8a, Shortest Paths on DAG |

scenes | Kattis - scenes | 4.8b, Counting Paths, Easier |

scrollingsign | Kattis - scrollingsign | 6.4a, String Matching, Standard |

secretchamber | Kattis - secretchamber | 4.5b, APSP, Variants |

secretsanta | Kattis - secretsanta | 5.6a, Probability, Easier |

sellingspatulas | Kattis - sellingspatulas | 3.5a, Max 1D/2D Range Sum |

semafori | Kattis - semafori | 1.4h, Time, Harder |

set | Kattis - set | 3.2c, Three+ Nested Loops, Easier |

shopaholic | Kattis - shopaholic | 3.4b, Involving Sorting, Easier |

shortestpath1 | Kattis - shortestpath1 | 4.4c, SSSP, Dijkstra, Easier |

shortestpath2 | Kattis - shortestpath2 | 4.4c, SSSP, Dijkstra, Easier |

shortestpath3 | Kattis - shortestpath3 | 4.4e, SSSP, -ve weight |

shuffling | Kattis - shuffling | 1.4a, Game (Card) |

sidewayssorting | Kattis - sidewayssorting | 2.2c, Sorting, Easier |

simpleaddition | Kattis - simpleaddition | 5.3a, Big Integer, Basic |

sjecista | Kattis - sjecista | 9.form, Formulas or Theorems |

skener | Kattis - skener | 6.3g, Output Formatting, Easier |

smallestmultiple | Kattis - smallestmultiple | 5.3d, Bonus: Others |

smartphone | Kattis - smartphone | 6.3i, String Comparison |

snapperhard | Kattis - snapperhard | 2.2e, Bit Manipulation |

sortofsorting | Kattis - sortofsorting | 2.2d, Sorting, Harder |

speed | Kattis - speed | 3.3b, Binary Search the Answer |

speedlimit | Kattis - speedlimit | 1.3c, Repetition Only |

spiderman | Kattis - spiderman | 3.5f, DP level 1 |

splat | Kattis - splat | 8.5f, Geometry and Other |

squaredeal | Kattis - squaredeal | 3.2f, Iterative (Combination) |

squarepegs | Kattis - squarepegs | 3.4a, Greedy (Classical) |

squawk | Kattis - squawk | 5.9a, Matrix Power |

srednji | Kattis - srednji | 2.3f, Balanced BST (map) |

statistics | Kattis - statistics | 1.3d, Control Flow |

stickysituation | Kattis - stickysituation | 7.2e, Triangles + Circles |

stockbroker | Kattis - stockbroker | 3.4e, Non Classical, Harder |

stringfactoring | Kattis - stringfactoring | 6.5b, DP String, Non Classic |

stringmatching | Kattis - stringmatching | 6.4a, String Matching, Standard |

subexpression | Kattis - subexpression | 6.3e, Recursive Parsing |

suffixarrayreconstruction | Kattis - suffixarrayreconstruction | 6.6a, Suffix Trie/Tree/Array |

suffixsorting | Kattis - suffixsorting | 6.6a, Suffix Trie/Tree/Array |

supercomputer | Kattis - supercomputer | 2.4c, Tree-related DS |

suspensionbridges | Kattis - suspensionbridges | 3.3b, Binary Search the Answer |

sylvester | Kattis - sylvester | 3.3c, Other DnC Problems |

tarifa | Kattis - tarifa | 1.3c, Repetition Only |

tautology | Kattis - tautology | 3.2d, Three+ Nested Loops, Harder |

temperatureconfusion | Kattis - temperatureconfusion | 5.5b, GCD and/or LCM |

teque | Kattis - teque | 2.2g, List/Queue/Deque |

terraces | Kattis - terraces | 4.2c, Flood Fill, Harder |

thebackslashproblem | Kattis - thebackslashproblem | 5.2g, Log, Exp, Pow |

thekingofthenorth | Kattis - thekingofthenorth | 4.6b, Network Flow, Variants |

thermostat | Kattis - thermostat | 5.3d, Bonus: Others |

thinkingofanumber | Kattis - thinkingofanumber | 5.5j, Other Number Theory |

threedigits | Kattis - threedigits | 5.5h, Modulo Arithmetic |

throwns | Kattis - throwns | 2.2f, Stack |

ticketpricing | Kattis - ticketpricing | 3.5f, DP level 1 |

tight | Kattis - tight | 8.3a, DP level 2 |

timebomb | Kattis - timebomb | 6.3d, Iterative Parsing |

timeloop | Kattis - timeloop | 1.3c, Repetition Only |

timezones | Kattis - timezones | 1.4h, Time, Harder |

toilet | Kattis - toilet | 1.4f, Real Life, Harder |

tourists | Kattis - tourists | 4.8d, Tree |

trainpassengers | Kattis - trainpassengers | 1.4e, Real Life, Easier |

trainsorting | Kattis - trainsorting | 3.5b, LIS |

transportation | Kattis - transportation | 4.6b, Network Flow, Variants |

transportationplanning | Kattis - transportationplanning | 4.5a, APSP, Standard |

traveltheskies | Kattis - traveltheskies | 2.4a, Graph Data Structures |

treasurediving | Kattis - treasurediving | 8.5c, Graph and DP |

treasurehunt | Kattis - treasurehunt | 1.3e, Function |

trendingtopic | Kattis - trendingtopic | 2.2g, List/Queue/Deque |

trilemma | Kattis - trilemma | 7.2e, Triangles + Circles |

trip | Kattis - trip | 5.2k, Just Ad Hoc |

tritiling | Kattis - tritiling | 5.4e, Others, Harder |

trollhunt | Kattis - trollhunt | 5.2a, Math Simulation, Easier |

turbo | Kattis - turbo | 2.4c, Tree-related DS |

turtlemaster | Kattis - turtlemaster | 1.4d, Game (Others), Harder |

ultraquicksort | Kattis - ultraquicksort | 9.inve, Inversion Index |

veci | Kattis - veci | 3.2e, Iterative (Permutation) |

vegetables | Kattis - vegetables | 2.3a, Priority Queue |

virus | Kattis - virus | 3.4e, Non Classical, Harder |

visualgo | Kattis - visualgo | 4.4d, SSSP, Dijkstra, Harder |

vote | Kattis - vote | 1.3g, Still Easy |

vuk | Kattis - vuk | 8.5d, Graph and Other |

walkforest | Kattis - walkforest | 8.5c, Graph and DP |

walls | Kattis - walls | 3.2g, Try All Possible Answers |

walrusweights | Kattis - walrusweights | 8.3a, DP level 2 |

watchdog | Kattis - watchdog | 7.2c, Circles |

wedding | Kattis - wedding | 8.4d, NP-hard/C, special, Harder |

wertyu | Kattis - wertyu | 1.4e, Real Life, Easier |

wheels | Kattis - wheels | 8.5h, Three Components |

wheresmyinternet | Kattis - wheresmyinternet | 4.2b, Flood Fill, Easier |

whichbase | Kattis - whichbase | 5.3c, Bonus: Base Number |

wifi | Kattis - wifi | 8.5a, Bsearch-ans and Others |

windows | Kattis - windows | 1.4i, Time Waster |

wizardofodds | Kattis - wizardofodds | 5.3a, Big Integer, Basic |

wordcloud | Kattis - wordcloud | 1.4f, Real Life, Harder |

workstations | Kattis - workstations | 2.3a, Priority Queue |

xyzzy | Kattis - xyzzy | 4.4e, SSSP, -ve weight |

yoda | Kattis - yoda | 5.2k, Just Ad Hoc |

zagrade | Kattis - zagrade | 3.2f, Iterative (Combination) |

zipfslaw | Kattis - zipfslaw | 6.3j, Ad Hoc String |

zoo | Kattis - zoo | 6.3c, Frequency Counting |