Methods to Solve

(back to Competitive Programming Book website)

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:

  1. 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
  2. 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
  3. 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
  4. 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
  5. CP3.19a, "Chapter 1 : Introduction" starred problems only or CP3.19a, all Chapter 1 problems
  6. CP3.19a, "Chapter 2 : Data Structures and Libraries" starred problems only or CP3.19a, all Chapter 2 problems
  7. CP3.19a, "Chapter 3 : Problem Solving Paradigms" starred problems only or CP3.19a, all Chapter 3 problems
  8. CP3.19a, "Chapter 4 : Graph" starred problems only or CP3.19a, all Chapter 4 problems
  9. CP3.19a, "Chapter 8 : More Advanced Topics" starred problems only or CP3.19a, all Chapter 8 problems
  10. Only starred problems from all chapters
  11. 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)

Problem Title CP3.19a++
Fetching from uHunt 2.2b, 2D Array Manipulation
Fetching from uHunt 3.2b, Iterative (Two Nested Loops)
Fetching from uHunt 4.2a, Just Graph Traversal
Fetching from uHunt 2.2d, Sorting, Harder
Fetching from uHunt 4.2d, Topological Sort
Fetching from uHunt 2.2f, Stack
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 9.anag, Anagram
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 4.2a, Just Graph Traversal
Fetching from uHunt 4.2a, Just Graph Traversal
Fetching from uHunt 9.anag, Anagram
Fetching from uHunt 4.2d, Topological Sort
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 2.2g, List/Queue/Deque
Fetching from uHunt 4.2c, Flood Fill, Harder
Fetching from uHunt 4.2a, Just Graph Traversal
Fetching from uHunt 8.2b, State-Space, BFS, Easier
Fetching from uHunt 9.inve, Inversion Index
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 4.2a, Just Graph Traversal
Fetching from uHunt 4.4a, SSSP, BFS, Easier
Fetching from uHunt 4.2b, Flood Fill, Easier
Fetching from uHunt 4.4a, SSSP, BFS, Easier
Fetching from uHunt 4.4a, SSSP, BFS, Easier
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 9.pala, Palindrome (Checking)
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 2.3d, Hash Table (map)
Fetching from uHunt 4.4a, SSSP, BFS, Easier
Fetching from uHunt 2.2b, 2D Array Manipulation
Fetching from uHunt 9.knig, Knight Moves
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 2.2d, Sorting, Harder
Fetching from uHunt 4.8a, Shortest Paths on DAG
Fetching from uHunt 4.2b, Flood Fill, Easier
Fetching from uHunt 2.2b, 2D Array Manipulation
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 4.2b, Flood Fill, Easier
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 2.3d, Hash Table (map)
Fetching from uHunt 2.3b, Direct Addressing Table
Fetching from uHunt 2.3e, Balanced BST (set)
Fetching from uHunt 2.2b, 2D Array Manipulation
Fetching from uHunt 2.2f, Stack
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 2.2g, List/Queue/Deque
Fetching from uHunt 2.2b, 2D Array Manipulation
Fetching from uHunt 9.brac, Bracket Matching
Fetching from uHunt 4.4e, SSSP, -ve weight
Fetching from uHunt 4.2b, Flood Fill, Easier
Fetching from uHunt 2.2b, 2D Array Manipulation
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 3.2b, Iterative (Two Nested Loops)
Fetching from uHunt 2.4a, Graph Data Structures
Fetching from uHunt 4.2c, Flood Fill, Harder
Fetching from uHunt 9.inve, Inversion Index
Fetching from uHunt 4.2a, Just Graph Traversal
Fetching from uHunt 3.2b, Iterative (Two Nested Loops)
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 4.4a, SSSP, BFS, Easier
Fetching from uHunt 4.2c, Flood Fill, Harder
Fetching from uHunt 8.2d, State-Space, Dijkstra
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 9.brac, Bracket Matching
Fetching from uHunt 3.3a, Binary Search
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 4.2a, Just Graph Traversal
Fetching from uHunt 2.2b, 2D Array Manipulation
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 4.2b, Flood Fill, Easier
Fetching from uHunt 2.2f, Stack
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 2.3b, Direct Addressing Table
Fetching from uHunt 4.2c, Flood Fill, Harder
Fetching from uHunt 4.4a, SSSP, BFS, Easier
Fetching from uHunt 4.2c, Flood Fill, Harder
Fetching from uHunt 4.2b, Flood Fill, Easier
Fetching from uHunt 4.2b, Flood Fill, Easier
Fetching from uHunt 4.2b, Flood Fill, Easier
Fetching from uHunt 2.2d, Sorting, Harder
Fetching from uHunt 4.2a, Just Graph Traversal
Fetching from uHunt 4.2a, Just Graph Traversal
Fetching from uHunt 4.2c, Flood Fill, Harder
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 2.3d, Hash Table (map)
Fetching from uHunt 4.2b, Flood Fill, Easier
Fetching from uHunt 4.2d, Topological Sort
Fetching from uHunt 2.3b, Direct Addressing Table
Fetching from uHunt 4.4a, SSSP, BFS, Easier
Fetching from uHunt 8.2b, State-Space, BFS, Easier
Fetching from uHunt 4.4c, SSSP, Dijkstra, Easier
Fetching from uHunt 2.3d, Hash Table (map)
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 3.3a, Binary Search
Fetching from uHunt 2.3e, Balanced BST (set)
Fetching from uHunt 8.2d, State-Space, Dijkstra
Fetching from uHunt 8.2d, State-Space, Dijkstra
Fetching from uHunt 2.2f, Stack
Fetching from uHunt 4.2c, Flood Fill, Harder
Fetching from uHunt 4.4c, SSSP, Dijkstra, Easier
Fetching from uHunt 4.4a, SSSP, BFS, Easier
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 2.3a, Priority Queue
Fetching from uHunt 3.2b, Iterative (Two Nested Loops)
Fetching from uHunt 2.3b, Direct Addressing Table
Fetching from uHunt 3.2b, Iterative (Two Nested Loops)
Fetching from uHunt 8.2b, State-Space, BFS, Easier
Fetching from uHunt 2.2d, Sorting, Harder
Fetching from uHunt 4.4a, SSSP, BFS, Easier
Fetching from uHunt 2.2b, 2D Array Manipulation
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 3.2b, Iterative (Two Nested Loops)
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 8.2b, State-Space, BFS, Easier
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 2.3b, Direct Addressing Table
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 3.3a, Binary Search
Fetching from uHunt 8.2b, State-Space, BFS, Easier
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 4.2a, Just Graph Traversal
Fetching from uHunt 4.2a, Just Graph Traversal
Fetching from uHunt 2.3d, Hash Table (map)
Fetching from uHunt 2.3f, Balanced BST (map)
Fetching from uHunt 2.3d, Hash Table (map)
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 2.2g, List/Queue/Deque
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 2.2d, Sorting, Harder
Fetching from uHunt 2.3f, Balanced BST (map)
Fetching from uHunt 2.2d, Sorting, Harder
Fetching from uHunt 4.8a, Shortest Paths on DAG
Fetching from uHunt 2.3b, Direct Addressing Table
Fetching from uHunt 8.2d, State-Space, Dijkstra
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 2.3d, Hash Table (map)
Fetching from uHunt 4.8a, Shortest Paths on DAG
Fetching from uHunt 2.3d, Hash Table (map)
Fetching from uHunt 4.2d, Topological Sort
Fetching from uHunt 8.2b, State-Space, BFS, Easier
Fetching from uHunt 4.2b, Flood Fill, Easier
Fetching from uHunt 4.8a, Shortest Paths on DAG
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 4.2a, Just Graph Traversal
Fetching from uHunt 4.4c, SSSP, Dijkstra, Easier
Fetching from uHunt 9.knig, Knight Moves
Fetching from uHunt 4.4e, SSSP, -ve weight
Fetching from uHunt 3.3a, Binary Search
Fetching from uHunt 9.knig, Knight Moves
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 4.2a, Just Graph Traversal
Fetching from uHunt 4.4e, SSSP, -ve weight
Fetching from uHunt 3.3a, Binary Search
Fetching from uHunt 3.2b, Iterative (Two Nested Loops)
Fetching from uHunt 4.2c, Flood Fill, Harder
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 4.4a, SSSP, BFS, Easier
Fetching from uHunt 3.3a, Binary Search
Fetching from uHunt 4.4a, SSSP, BFS, Easier
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 8.2b, State-Space, BFS, Easier
Fetching from uHunt 2.3d, Hash Table (map)
Fetching from uHunt 4.2a, Just Graph Traversal
Fetching from uHunt 2.2d, Sorting, Harder
Fetching from uHunt 2.2b, 2D Array Manipulation
Fetching from uHunt 3.3a, Binary Search
Fetching from uHunt 4.2c, Flood Fill, Harder
Fetching from uHunt 3.2b, Iterative (Two Nested Loops)
Fetching from uHunt 3.3a, Binary Search
Fetching from uHunt 3.4b, Involving Sorting, Easier
Fetching from uHunt 3.4b, Involving Sorting, Easier
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 2.3e, Balanced BST (set)
Fetching from uHunt 9.pala, Palindrome (Checking)
Fetching from uHunt 2.2b, 2D Array Manipulation
Fetching from uHunt 2.2f, Stack
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 2.3c, Hash Table (set)
Fetching from uHunt 2.4a, Graph Data Structures
Fetching from uHunt 2.2g, List/Queue/Deque
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 2.2b, 2D Array Manipulation
Fetching from uHunt 8.2d, State-Space, Dijkstra
Fetching from uHunt 2.4a, Graph Data Structures
Fetching from uHunt 2.2g, List/Queue/Deque
Fetching from uHunt 4.2c, Flood Fill, Harder
Fetching from uHunt 2.3a, Priority Queue
Fetching from uHunt 4.4a, SSSP, BFS, Easier
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 4.4c, SSSP, Dijkstra, Easier
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Kattis - 10kindsofpeople 4.2c, Flood Fill, Harder
Fetching from uHunt 2.2g, List/Queue/Deque
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 2.2b, 2D Array Manipulation
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 3.3a, Binary Search
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 4.2d, Topological Sort
Fetching from uHunt 2.3e, Balanced BST (set)
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 4.2c, Flood Fill, Harder
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 4.2c, Flood Fill, Harder
Fetching from uHunt 9.brac, Bracket Matching
Fetching from uHunt 2.3e, Balanced BST (set)
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 3.2b, Iterative (Two Nested Loops)
Fetching from uHunt 4.2b, Flood Fill, Easier
Fetching from uHunt 3.4b, Involving Sorting, Easier
Fetching from uHunt 4.4e, SSSP, -ve weight
Fetching from uHunt 2.3d, Hash Table (map)
Fetching from uHunt 2.2d, Sorting, Harder
Fetching from uHunt 2.3f, Balanced BST (map)
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 2.3b, Direct Addressing Table
Fetching from uHunt 2.3d, Hash Table (map)
Fetching from uHunt 2.2b, 2D Array Manipulation
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 2.2b, 2D Array Manipulation
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 3.4b, Involving Sorting, Easier
Fetching from uHunt 8.2d, State-Space, Dijkstra
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 4.2b, Flood Fill, Easier
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 9.inve, Inversion Index
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 8.2b, State-Space, BFS, Easier
Fetching from uHunt 2.4a, Graph Data Structures
Fetching from uHunt 4.2c, Flood Fill, Harder
Fetching from uHunt 2.3d, Hash Table (map)
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 2.2b, 2D Array Manipulation
Fetching from uHunt 9.pala, Palindrome (Checking)
Fetching from uHunt 4.2c, Flood Fill, Harder
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 3.3a, Binary Search
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 2.3d, Hash Table (map)
Fetching from uHunt 9.knig, Knight Moves
Fetching from uHunt 4.2d, Topological Sort
Fetching from uHunt 3.4b, Involving Sorting, Easier
Fetching from uHunt 4.2c, Flood Fill, Harder
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 2.2g, List/Queue/Deque
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 4.2a, Just Graph Traversal
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 2.2b, 2D Array Manipulation
Fetching from uHunt 4.2c, Flood Fill, Harder
Fetching from uHunt 2.3c, Hash Table (set)
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 2.3d, Hash Table (map)
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 3.3a, Binary Search
Fetching from uHunt 9.pala, Palindrome (Checking)
Fetching from uHunt 3.4b, Involving Sorting, Easier
Fetching from uHunt 4.2a, Just Graph Traversal
Fetching from uHunt 4.2a, Just Graph Traversal
Fetching from uHunt 2.3d, Hash Table (map)
Fetching from uHunt 4.2b, Flood Fill, Easier
Fetching from uHunt 8.2b, State-Space, BFS, Easier
Fetching from uHunt 2.2g, List/Queue/Deque
Fetching from uHunt 2.4a, Graph Data Structures
Fetching from uHunt 2.3a, Priority Queue
Fetching from uHunt 2.3a, Priority Queue
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 2.3c, Hash Table (set)
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 2.2g, List/Queue/Deque
Fetching from uHunt 2.2g, List/Queue/Deque
Fetching from uHunt 8.2b, State-Space, BFS, Easier
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 4.4a, SSSP, BFS, Easier
Fetching from uHunt 2.2b, 2D Array Manipulation
Fetching from uHunt 3.3a, Binary Search
Fetching from uHunt 3.2b, Iterative (Two Nested Loops)
Fetching from uHunt 2.2g, List/Queue/Deque
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 2.2b, 2D Array Manipulation
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 4.2a, Just Graph Traversal
Fetching from uHunt 2.3a, Priority Queue
Fetching from uHunt 2.2b, 2D Array Manipulation
Fetching from uHunt 4.2a, Just Graph Traversal
Fetching from uHunt 3.4b, Involving Sorting, Easier
Fetching from uHunt 3.2b, Iterative (Two Nested Loops)
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 2.3f, Balanced BST (map)
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 4.2a, Just Graph Traversal
Fetching from uHunt 3.2b, Iterative (Two Nested Loops)
Fetching from uHunt 2.3d, Hash Table (map)
Fetching from uHunt 9.anag, Anagram
Fetching from uHunt 4.2a, Just Graph Traversal
Fetching from uHunt 2.3b, Direct Addressing Table
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 2.2b, 2D Array Manipulation
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 9.anag, Anagram
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 2.2d, Sorting, Harder
Fetching from uHunt 2.2b, 2D Array Manipulation
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 4.2a, Just Graph Traversal
Fetching from uHunt 3.2b, Iterative (Two Nested Loops)
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 3.4b, Involving Sorting, Easier
Fetching from uHunt 2.3e, Balanced BST (set)
Fetching from uHunt 4.2a, Just Graph Traversal
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 2.2f, Stack
Fetching from uHunt 3.4b, Involving Sorting, Easier
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 4.4c, SSSP, Dijkstra, Easier
Fetching from uHunt 2.3c, Hash Table (set)
Fetching from uHunt 2.3a, Priority Queue
Fetching from uHunt 2.2a, 1D Array Manipulation
Fetching from uHunt 2.3a, Priority Queue
Fetching from uHunt 9.inve, Inversion Index
Kattis - 2048 2.2b, 2D Array Manipulation
Kattis - 8queens 3.2b, Iterative (Two Nested Loops)
Kattis - abinitio 2.4a, Graph Data Structures
Kattis - acm2 3.4b, Involving Sorting, Easier
Kattis - administrativeproblems 2.3f, Balanced BST (map)
Kattis - akcija 3.4b, Involving Sorting, Easier
Kattis - amoebas 4.2b, Flood Fill, Easier
Kattis - antiarithmetic 3.2b, Iterative (Two Nested Loops)
Kattis - aprizenoonecanwin 3.4b, Involving Sorting, Easier
Kattis - awkwardparty 2.3d, Hash Table (map)
Kattis - babelfish 2.3d, Hash Table (map)
Kattis - backspace 2.2g, List/Queue/Deque
Kattis - baconeggsandspam 2.3f, Balanced BST (map)
Kattis - ballotboxes 2.3a, Priority Queue
Kattis - baloni 2.2a, 1D Array Manipulation
Kattis - bard 2.3c, Hash Table (set)
Kattis - basicinterpreter 2.3d, Hash Table (map)
Kattis - bestrelayteam 3.2b, Iterative (Two Nested Loops)
Kattis - bigtruck 8.2d, State-Space, Dijkstra
Kattis - blackfriday 3.2b, Iterative (Two Nested Loops)
Kattis - blockcrusher 4.4d, SSSP, Dijkstra, Harder
Kattis - boatparts 2.3c, Hash Table (set)
Kattis - booking 2.2d, Sorting, Harder
Kattis - bookingaroom 2.3b, Direct Addressing Table
Kattis - bread 9.inve, Inversion Index
Kattis - brexit 4.2d, Topological Sort
Kattis - bst 2.3e, Balanced BST (set)
Kattis - builddeps 4.2d, Topological Sort
Kattis - bumped 8.2d, State-Space, Dijkstra
Kattis - busnumbers 2.3b, Direct Addressing Table
Kattis - buttonbashing 4.4a, SSSP, BFS, Easier
Kattis - candydivision 2.3e, Balanced BST (set)
Kattis - cd 2.3c, Hash Table (set)
Kattis - chartingprogress 2.2c, Sorting, Easier
Kattis - chopwood 2.4a, Graph Data Structures
Kattis - classy 2.2d, Sorting, Harder
Kattis - closestsums 3.2b, Iterative (Two Nested Loops)
Kattis - closingtheloop 2.2c, Sorting, Easier
Kattis - coast 4.2c, Flood Fill, Harder
Kattis - coconut 2.2g, List/Queue/Deque
Kattis - compoundwords 2.3e, Balanced BST (set)
Kattis - compromise 2.2b, 2D Array Manipulation
Kattis - conformity 2.3d, Hash Table (map)
Kattis - conquestcampaign 4.4b, SSSP, BFS, Harder
Kattis - conservation 4.2d, Topological Sort
Kattis - conversationlog 2.3d, Hash Table (map)
Kattis - costumecontest 2.3d, Hash Table (map)
Kattis - countingstars 4.2b, Flood Fill, Easier
Kattis - crosscountry 4.4e, SSSP, -ve weight
Kattis - cudoviste 3.2c, Three+ Nested Loops, Easier
Kattis - cups 2.2c, Sorting, Easier
Kattis - delimitersoup 9.brac, Bracket Matching
Kattis - destinationunknown 8.2d, State-Space, Dijkstra
Kattis - divideby100 2.2a, 1D Array Manipulation
Kattis - dominoes2 4.2b, Flood Fill, Easier
Kattis - downtime 2.2a, 1D Array Manipulation
Kattis - dream 2.2f, Stack
Kattis - dungeon 4.4b, SSSP, BFS, Harder
Kattis - dyslectionary 2.2d, Sorting, Harder
Kattis - ecoins 8.2b, State-Space, BFS, Easier
Kattis - elevatortrouble 8.2b, State-Space, BFS, Easier
Kattis - emptyingbaltic 4.4d, SSSP, Dijkstra, Harder
Kattis - engineeringenglish 2.3c, Hash Table (set)
Kattis - epigdanceoff 2.2b, 2D Array Manipulation
Kattis - erase 2.2a, 1D Array Manipulation
Kattis - erraticants 4.4b, SSSP, BFS, Harder
Kattis - esej 2.3c, Hash Table (set)
Kattis - evenup 2.2f, Stack
Kattis - everywhere 2.3c, Hash Table (set)
Kattis - fallingapart 3.4b, Involving Sorting, Easier
Kattis - faultyrobot 4.2a, Just Graph Traversal
Kattis - ferryloading3 2.2g, List/Queue/Deque
Kattis - ferryloading4 2.2g, List/Queue/Deque
Kattis - fire2 4.4b, SSSP, BFS, Harder
Kattis - fire3 4.4b, SSSP, BFS, Harder
Kattis - firefly 3.3a, Binary Search
Kattis - firestation 4.4d, SSSP, Dijkstra, Harder
Kattis - flipfive 8.2b, State-Space, BFS, Easier
Kattis - flowerytrails 4.4c, SSSP, Dijkstra, Easier
Kattis - flowshop 2.2b, 2D Array Manipulation
Kattis - flyingsafely 2.4a, Graph Data Structures
Kattis - foosball 2.2g, List/Queue/Deque
Kattis - freefood 2.3b, Direct Addressing Table
Kattis - fridge 3.4b, Involving Sorting, Easier
Kattis - froshweek 9.inve, Inversion Index
Kattis - fulltank 4.4d, SSSP, Dijkstra, Harder
Kattis - funhouse 2.2b, 2D Array Manipulation
Kattis - george 4.4c, SSSP, Dijkstra, Easier
Kattis - getshorty 4.4c, SSSP, Dijkstra, Easier
Kattis - gettowork 3.4b, Involving Sorting, Easier
Kattis - gold 4.2c, Flood Fill, Harder
Kattis - golombrulers 3.2b, Iterative (Two Nested Loops)
Kattis - grandpabernie 2.3d, Hash Table (map)
Kattis - grasshopper 9.knig, Knight Moves
Kattis - greedilyincreasing 2.2a, 1D Array Manipulation
Kattis - greetingcard 2.3c, Hash Table (set)
Kattis - grid 4.4a, SSSP, BFS, Easier
Kattis - guess 3.3a, Binary Search
Kattis - guessthedatastructure 2.3a, Priority Queue
Kattis - hardware 2.3b, Direct Addressing Table
Kattis - hardwoodspecies 2.3f, Balanced BST (map)
Kattis - haypoints 2.3d, Hash Table (map)
Kattis - height 2.2c, Sorting, Easier
Kattis - hidingplaces 9.knig, Knight Moves
Kattis - horror 4.4a, SSSP, BFS, Easier
Kattis - hydrasheads 8.2b, State-Space, BFS, Easier
Kattis - icpcawards 2.3c, Hash Table (set)
Kattis - icpcteamselection 3.4b, Involving Sorting, Easier
Kattis - imageprocessing 2.2b, 2D Array Manipulation
Kattis - includescoring 2.2d, Sorting, Harder
Kattis - integerlists 2.2g, List/Queue/Deque
Kattis - islands3 4.2c, Flood Fill, Harder
Kattis - iwannabe 2.3c, Hash Table (set)
Kattis - joinstrings 2.2g, List/Queue/Deque
Kattis - jollyjumpers 2.2a, 1D Array Manipulation
Kattis - judging 2.2c, Sorting, Easier
Kattis - kaleidoscopicpalindromes 9.pala, Palindrome (Checking)
Kattis - kattissquest 2.3f, Balanced BST (map)
Kattis - knightsfen 9.knig, Knight Moves
Kattis - lawnmower 2.2c, Sorting, Easier
Kattis - lineup 2.2c, Sorting, Easier
Kattis - lost 4.4b, SSSP, BFS, Harder
Kattis - mallmania 4.4b, SSSP, BFS, Harder
Kattis - managingpackaging 4.2d, Topological Sort
Kattis - mastermind 2.2a, 1D Array Manipulation
Kattis - minimumscalar 3.4b, Involving Sorting, Easier
Kattis - missinggnomes 2.3e, Balanced BST (set)
Kattis - mjehuric 2.2c, Sorting, Easier
Kattis - moneymatters 4.2b, Flood Fill, Easier
Kattis - mravi 4.8a, Shortest Paths on DAG
Kattis - multigram 9.anag, Anagram
Kattis - musicyourway 2.2d, Sorting, Harder
Kattis - nineknights 2.2b, 2D Array Manipulation
Kattis - nodup 2.3c, Hash Table (set)
Kattis - notamused 2.3f, Balanced BST (map)
Kattis - npuzzle 3.2c, Three+ Nested Loops, Easier
Kattis - numbertree 2.3a, Priority Queue
Kattis - oceancurrents 4.4b, SSSP, BFS, Harder
Kattis - oddmanout 2.3c, Hash Table (set)
Kattis - onemorebellmanford 4.4e, SSSP, -ve weight
Kattis - opensource 2.3f, Balanced BST (map)
Kattis - pairingsocks 2.2f, Stack
Kattis - palindromesubstring 9.pala, Palindrome (Checking)
Kattis - patuljci 3.2c, Three+ Nested Loops, Easier
Kattis - peg 3.2b, Iterative (Two Nested Loops)
Kattis - peragrams 9.pala, Palindrome (Checking)
Kattis - pet 3.2b, Iterative (Two Nested Loops)
Kattis - pickupsticks 4.2d, Topological Sort
Kattis - pikemaneasy 3.4b, Involving Sorting, Easier
Kattis - pivot 2.2a, 1D Array Manipulation
Kattis - pizzahawaii 2.3c, Hash Table (set)
Kattis - planetaris 3.4b, Involving Sorting, Easier
Kattis - plantingtrees 3.4b, Involving Sorting, Easier
Kattis - princesspeach 2.3b, Direct Addressing Table
Kattis - promotions 4.2a, Just Graph Traversal
Kattis - prva 2.2b, 2D Array Manipulation
Kattis - putovanje 3.2b, Iterative (Two Nested Loops)
Kattis - quickbrownfox 2.3b, Direct Addressing Table
Kattis - rationalsequence2 2.3a, Priority Queue
Kattis - rationalsequence3 2.3a, Priority Queue
Kattis - reachableroads 4.2b, Flood Fill, Easier
Kattis - recount 2.3d, Hash Table (map)
Kattis - redistribution 3.4b, Involving Sorting, Easier
Kattis - reduction 3.2b, Iterative (Two Nested Loops)
Kattis - register 3.2b, Iterative (Two Nested Loops)
Kattis - relocation 2.3b, Direct Addressing Table
Kattis - restaurant 2.2f, Stack
Kattis - reversebinary 2.2f, Stack
Kattis - rings2 2.2b, 2D Array Manipulation
Kattis - rockband 2.2a, 1D Array Manipulation
Kattis - rollcall 2.3d, Hash Table (map)
Kattis - roompainting 3.3a, Binary Search
Kattis - runningmom 4.2a, Just Graph Traversal
Kattis - safe 8.2b, State-Space, BFS, Easier
Kattis - safehouses 3.2c, Three+ Nested Loops, Easier
Kattis - safepassage 4.8a, Shortest Paths on DAG
Kattis - savinguniverse 4.8a, Shortest Paths on DAG
Kattis - securedoors 2.3c, Hash Table (set)
Kattis - server 2.2g, List/Queue/Deque
Kattis - set 3.2c, Three+ Nested Loops, Easier
Kattis - shiritori 2.3c, Hash Table (set)
Kattis - shopaholic 3.4b, Involving Sorting, Easier
Kattis - shortestpath1 4.4c, SSSP, Dijkstra, Easier
Kattis - shortestpath2 4.4c, SSSP, Dijkstra, Easier
Kattis - shortestpath3 4.4e, SSSP, -ve weight
Kattis - showroom 4.4b, SSSP, BFS, Harder
Kattis - sidewayssorting 2.2c, Sorting, Easier
Kattis - sixdegrees 4.4b, SSSP, BFS, Harder
Kattis - slikar 4.4b, SSSP, BFS, Harder
Kattis - snowflakes 2.3d, Hash Table (map)
Kattis - sortofsorting 2.2d, Sorting, Harder
Kattis - spiral 4.4a, SSSP, BFS, Easier
Kattis - srednji 2.3f, Balanced BST (map)
Kattis - subway2 4.4c, SSSP, Dijkstra, Easier
Kattis - succession 4.2a, Just Graph Traversal
Kattis - symmetricorder 2.2f, Stack
Kattis - synchronizinglists 2.2c, Sorting, Easier
Kattis - telephones 3.2b, Iterative (Two Nested Loops)
Kattis - teque 2.2g, List/Queue/Deque
Kattis - terraces 4.2c, Flood Fill, Harder
Kattis - tetris 2.2b, 2D Array Manipulation
Kattis - textmessaging 3.4b, Involving Sorting, Easier
Kattis - throwns 2.2f, Stack
Kattis - torn2pieces 4.2a, Just Graph Traversal
Kattis - tourdefrance 3.2b, Iterative (Two Nested Loops)
Kattis - traveltheskies 2.4a, Graph Data Structures
Kattis - trendingtopic 2.2g, List/Queue/Deque
Kattis - ultraquicksort 9.inve, Inversion Index
Kattis - variablearithmetic 2.3d, Hash Table (map)
Kattis - vegetables 2.3a, Priority Queue
Kattis - visualgo 4.4d, SSSP, Dijkstra, Harder
Kattis - warehouse 2.3f, Balanced BST (map)
Kattis - weakvertices 2.4a, Graph Data Structures
Kattis - whatdoesthefoxsay 2.3c, Hash Table (set)
Kattis - wheresmyinternet 4.2b, Flood Fill, Easier
Kattis - wine 4.4d, SSSP, Dijkstra, Harder
Kattis - woodcutting 3.4b, Involving Sorting, Easier
Kattis - workstations 2.3a, Priority Queue
Kattis - xyzzy 4.4e, SSSP, -ve weight