*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++ |
---|---|---|

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

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

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

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

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

00127 | Fetching from uHunt | 2.2f, Stack |

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

00514 | Fetching from uHunt | 2.2f, Stack |

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

00732 | Fetching from uHunt | 2.2f, Stack |

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

01062 | Fetching from uHunt | 2.2f, Stack |

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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 |

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

10858 | Fetching from uHunt | 2.2f, Stack |

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

10kindsofpeople | Kattis - 10kindsofpeople | 4.2c, Flood Fill, Harder |

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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 |

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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 |

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

13055 | Fetching from uHunt | 2.2f, Stack |

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

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

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

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 |

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

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

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

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

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

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

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

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

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

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

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

backspace | Kattis - backspace | 2.2g, List/Queue/Deque |

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

coconut | Kattis - coconut | 2.2g, List/Queue/Deque |

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

dream | Kattis - dream | 2.2f, Stack |

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

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

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

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

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

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

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

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

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

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

evenup | Kattis - evenup | 2.2f, Stack |

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

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

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

ferryloading3 | Kattis - ferryloading3 | 2.2g, List/Queue/Deque |

ferryloading4 | Kattis - ferryloading4 | 2.2g, List/Queue/Deque |

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

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

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

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

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

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

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

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

foosball | Kattis - foosball | 2.2g, List/Queue/Deque |

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

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

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

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

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

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

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

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

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

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

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

grasshopper | Kattis - grasshopper | 9.knig, Knight Moves |

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

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

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

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

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

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

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

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

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

hidingplaces | Kattis - hidingplaces | 9.knig, Knight Moves |

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

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

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

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

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

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

integerlists | Kattis - integerlists | 2.2g, List/Queue/Deque |

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

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

joinstrings | Kattis - joinstrings | 2.2g, List/Queue/Deque |

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

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

kaleidoscopicpalindromes | Kattis - kaleidoscopicpalindromes | 9.pala, Palindrome (Checking) |

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

knightsfen | Kattis - knightsfen | 9.knig, Knight Moves |

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

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

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

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

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

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

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

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

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

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

mravi | Kattis - mravi | 4.8a, Shortest Paths on DAG |

multigram | Kattis - multigram | 9.anag, Anagram |

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

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

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

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

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

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

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

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

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

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

pairingsocks | Kattis - pairingsocks | 2.2f, Stack |

palindromesubstring | Kattis - palindromesubstring | 9.pala, Palindrome (Checking) |

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

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

peragrams | Kattis - peragrams | 9.pala, Palindrome (Checking) |

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

restaurant | Kattis - restaurant | 2.2f, Stack |

reversebinary | Kattis - reversebinary | 2.2f, Stack |

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

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

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

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

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

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

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

safepassage | Kattis - safepassage | 4.8a, Shortest Paths on DAG |

savinguniverse | Kattis - savinguniverse | 4.8a, Shortest Paths on DAG |

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

server | Kattis - server | 2.2g, List/Queue/Deque |

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

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

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 |

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

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

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

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

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

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

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

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

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

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

symmetricorder | Kattis - symmetricorder | 2.2f, Stack |

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

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

teque | Kattis - teque | 2.2g, List/Queue/Deque |

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

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

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

throwns | Kattis - throwns | 2.2f, Stack |

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

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

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

trendingtopic | Kattis - trendingtopic | 2.2g, List/Queue/Deque |

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

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

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

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

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

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

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

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

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

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

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

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