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 3.2b, Iterative (Two Nested Loops)
Fetching from uHunt 3.5a, Max 1D/2D Range Sum
Fetching from uHunt 3.5b, LIS
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 2.2d, Sorting, Harder
Fetching from uHunt 3.2i, Backtracking (Harder)
Fetching from uHunt 3.5d, Coin-Change
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 3.5d, Coin-Change
Fetching from uHunt 3.3c, Other DnC Problems
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 3.2i, Backtracking (Harder)
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 3.5e, TSP
Fetching from uHunt 3.2i, Backtracking (Harder)
Fetching from uHunt 3.5b, LIS
Fetching from uHunt 3.5d, Coin-Change
Fetching from uHunt 3.2d, Three+ Nested Loops, Harder
Fetching from uHunt 3.2d, Three+ Nested Loops, Harder
Fetching from uHunt 8.2b, State-Space, BFS, Easier
Fetching from uHunt 3.2i, Backtracking (Harder)
Fetching from uHunt 3.2i, Backtracking (Harder)
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 3.2i, Backtracking (Harder)
Fetching from uHunt 4.4a, SSSP, BFS, Easier
Fetching from uHunt 3.5d, Coin-Change
Fetching from uHunt 5.4b, Binomial Coefficients
Fetching from uHunt 4.4a, SSSP, BFS, Easier
Fetching from uHunt 3.2d, Three+ Nested Loops, Harder
Fetching from uHunt 4.4a, SSSP, BFS, Easier
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 3.4a, Greedy (Classical)
Fetching from uHunt 3.2i, Backtracking (Harder)
Fetching from uHunt 4.4a, SSSP, BFS, Easier
Fetching from uHunt 3.5c, 0-1 Knapsack
Fetching from uHunt 3.2i, Backtracking (Harder)
Fetching from uHunt 3.5b, LIS
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 2.2d, Sorting, Harder
Fetching from uHunt 3.5b, LIS
Fetching from uHunt 5.4a, Fibonacci Numbers
Fetching from uHunt 3.5b, LIS
Fetching from uHunt 3.5a, Max 1D/2D Range Sum
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 4.3b, MST, Variants
Fetching from uHunt 8.4a, NP-hard/C, small, Easier
Fetching from uHunt 4.3b, MST, Variants
Fetching from uHunt 4.4e, SSSP, -ve weight
Fetching from uHunt 3.5c, 0-1 Knapsack
Fetching from uHunt 3.2i, Backtracking (Harder)
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 3.2b, Iterative (Two Nested Loops)
Fetching from uHunt 3.3c, Other DnC Problems
Fetching from uHunt 3.2b, Iterative (Two Nested Loops)
Fetching from uHunt 8.4a, NP-hard/C, small, Easier
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 4.4a, SSSP, BFS, Easier
Fetching from uHunt 7.3a, Polygon, Easier
Fetching from uHunt 8.2d, State-Space, Dijkstra
Fetching from uHunt 3.5d, Coin-Change
Fetching from uHunt 3.3a, Binary Search
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 4.4a, SSSP, BFS, Easier
Fetching from uHunt 5.4a, Fibonacci Numbers
Fetching from uHunt 3.5a, Max 1D/2D Range Sum
Fetching from uHunt 2.2d, Sorting, Harder
Fetching from uHunt 2.4b, Union-Find Disjoint Sets
Fetching from uHunt 4.5a, APSP, Standard
Fetching from uHunt 3.5a, Max 1D/2D Range Sum
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 4.5b, APSP, Variants
Fetching from uHunt 4.3a, MST, Standard
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 4.4b, SSSP, BFS, Harder
Fetching from uHunt 3.3a, Binary Search
Fetching from uHunt 3.5a, Max 1D/2D Range Sum
Fetching from uHunt 8.4a, NP-hard/C, small, Easier
Fetching from uHunt 3.5c, 0-1 Knapsack
Fetching from uHunt 4.3b, MST, Variants
Fetching from uHunt 8.2d, State-Space, Dijkstra
Fetching from uHunt 4.5b, APSP, Variants
Fetching from uHunt 8.2d, State-Space, Dijkstra
Fetching from uHunt 3.5a, Max 1D/2D Range Sum
Fetching from uHunt 4.4c, SSSP, Dijkstra, Easier
Fetching from uHunt 4.4a, SSSP, BFS, Easier
Fetching from uHunt 4.3b, MST, Variants
Fetching from uHunt 4.3a, MST, Standard
Fetching from uHunt 6.5a, DP String, Classic
Fetching from uHunt 3.4a, Greedy (Classical)
Fetching from uHunt 3.5b, LIS
Fetching from uHunt 2.4b, Union-Find Disjoint Sets
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 4.3a, MST, Standard
Fetching from uHunt 3.5c, 0-1 Knapsack
Fetching from uHunt 4.3b, MST, Variants
Fetching from uHunt 4.3b, MST, Variants
Fetching from uHunt 4.3a, MST, Standard
Fetching from uHunt 4.5a, APSP, Standard
Fetching from uHunt 3.2b, Iterative (Two Nested Loops)
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 3.2i, Backtracking (Harder)
Fetching from uHunt 4.3b, MST, Variants
Fetching from uHunt 2.4b, Union-Find Disjoint Sets
Fetching from uHunt 8.4c, NP-hard/C, special, Easier
Fetching from uHunt 6.4a, String Matching, Standard
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 3.3c, Other DnC Problems
Fetching from uHunt 3.3b, Binary Search the Answer
Fetching from uHunt 3.2i, Backtracking (Harder)
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 4.4a, SSSP, BFS, Easier
Fetching from uHunt 3.4a, Greedy (Classical)
Fetching from uHunt 4.3a, MST, Standard
Fetching from uHunt 3.5f, DP level 1
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 4.3b, MST, Variants
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 3.2i, Backtracking (Harder)
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 3.5a, Max 1D/2D Range Sum
Fetching from uHunt 3.3a, Binary Search
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 3.2i, Backtracking (Harder)
Fetching from uHunt 8.2b, State-Space, BFS, Easier
Fetching from uHunt 4.3b, MST, Variants
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 3.5c, 0-1 Knapsack
Fetching from uHunt 3.5b, LIS
Fetching from uHunt 4.3b, MST, Variants
Fetching from uHunt 3.4d, Non Classical, Easier
Fetching from uHunt 3.5b, LIS
Fetching from uHunt 2.4b, Union-Find Disjoint Sets
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 2.2d, Sorting, Harder
Fetching from uHunt 2.4b, Union-Find Disjoint Sets
Fetching from uHunt 5.9a, Matrix Power
Fetching from uHunt 9.clos, Closest Pair Problem
Fetching from uHunt 3.4a, Greedy (Classical)
Fetching from uHunt 2.2d, Sorting, Harder
Fetching from uHunt 3.5c, 0-1 Knapsack
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 8.2b, State-Space, BFS, Easier
Fetching from uHunt 3.5d, Coin-Change
Fetching from uHunt 5.4a, Fibonacci Numbers
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 3.4d, Non Classical, Easier
Fetching from uHunt 3.3b, Binary Search the Answer
Fetching from uHunt 4.5b, APSP, Variants
Fetching from uHunt 4.5a, APSP, Standard
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 3.2d, Three+ Nested Loops, Harder
Fetching from uHunt 3.2d, Three+ Nested Loops, Harder
Fetching from uHunt 4.3b, MST, Variants
Fetching from uHunt 3.4a, Greedy (Classical)
Fetching from uHunt 4.4c, SSSP, Dijkstra, Easier
Fetching from uHunt 4.3b, MST, Variants
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 6.5a, DP String, Classic
Fetching from uHunt 3.4d, Non Classical, Easier
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 3.5d, Coin-Change
Fetching from uHunt 4.4e, SSSP, -ve weight
Fetching from uHunt 4.3b, MST, Variants
Fetching from uHunt 3.2i, Backtracking (Harder)
Fetching from uHunt 4.3b, MST, Variants
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 3.3a, Binary Search
Fetching from uHunt 3.2i, Backtracking (Harder)
Fetching from uHunt 3.2d, Three+ Nested Loops, Harder
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 3.2i, Backtracking (Harder)
Fetching from uHunt 2.4b, Union-Find Disjoint Sets
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 3.5b, LIS
Fetching from uHunt 5.4b, Binomial Coefficients
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 3.2i, Backtracking (Harder)
Fetching from uHunt 2.4b, Union-Find Disjoint Sets
Fetching from uHunt 4.3b, MST, Variants
Fetching from uHunt 3.4d, Non Classical, Easier
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 2.4b, Union-Find Disjoint Sets
Fetching from uHunt 4.4a, SSSP, BFS, Easier
Fetching from uHunt 3.3a, Binary Search
Fetching from uHunt 3.5c, 0-1 Knapsack
Fetching from uHunt 4.4a, SSSP, BFS, Easier
Fetching from uHunt 5.9a, Matrix Power
Fetching from uHunt 3.4d, Non Classical, Easier
Fetching from uHunt 3.2d, Three+ Nested Loops, Harder
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 3.5c, 0-1 Knapsack
Fetching from uHunt 3.5a, Max 1D/2D Range Sum
Fetching from uHunt 3.4d, Non Classical, Easier
Fetching from uHunt 8.2b, State-Space, BFS, Easier
Fetching from uHunt 3.5a, Max 1D/2D Range Sum
Fetching from uHunt 2.4b, Union-Find Disjoint Sets
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 5.4a, Fibonacci Numbers
Fetching from uHunt 3.5c, 0-1 Knapsack
Fetching from uHunt 2.2d, Sorting, Harder
Fetching from uHunt 3.4d, Non Classical, Easier
Fetching from uHunt 3.3a, Binary Search
Fetching from uHunt 3.4d, Non Classical, Easier
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 3.2b, Iterative (Two Nested Loops)
Fetching from uHunt 3.3a, Binary Search
Fetching from uHunt 3.5a, Max 1D/2D Range Sum
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 3.5c, 0-1 Knapsack
Fetching from uHunt 3.5a, Max 1D/2D Range Sum
Fetching from uHunt 4.3b, MST, Variants
Fetching from uHunt 8.4c, NP-hard/C, special, Easier
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 8.2d, State-Space, Dijkstra
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 4.4a, SSSP, BFS, Easier
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 3.2d, Three+ Nested Loops, Harder
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 4.4c, SSSP, Dijkstra, Easier
Fetching from uHunt 4.5b, APSP, Variants
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 3.5c, 0-1 Knapsack
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 3.2i, Backtracking (Harder)
Fetching from uHunt 3.4d, Non Classical, Easier
Fetching from uHunt 3.3a, Binary Search
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 7.3a, Polygon, Easier
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 3.2d, Three+ Nested Loops, Harder
Fetching from uHunt 3.5d, Coin-Change
Fetching from uHunt 3.3c, Other DnC Problems
Fetching from uHunt 4.3a, MST, Standard
Fetching from uHunt 3.2d, Three+ Nested Loops, Harder
Fetching from uHunt 3.2b, Iterative (Two Nested Loops)
Fetching from uHunt 3.5d, Coin-Change
Fetching from uHunt 3.4a, Greedy (Classical)
Fetching from uHunt 3.4b, Involving Sorting, Easier
Fetching from uHunt 4.4e, SSSP, -ve weight
Fetching from uHunt 3.4a, Greedy (Classical)
Fetching from uHunt 2.2d, Sorting, Harder
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 3.5c, 0-1 Knapsack
Fetching from uHunt 3.2d, Three+ Nested Loops, Harder
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 8.4c, NP-hard/C, special, Easier
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 9.clos, Closest Pair Problem
Fetching from uHunt 3.4a, Greedy (Classical)
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 3.3b, Binary Search the Answer
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 7.3a, Polygon, Easier
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 3.5b, LIS
Fetching from uHunt 4.5a, APSP, Standard
Fetching from uHunt 7.3a, Polygon, Easier
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 2.4b, Union-Find Disjoint Sets
Fetching from uHunt 8.2b, State-Space, BFS, Easier
Fetching from uHunt 3.4d, Non Classical, Easier
Fetching from uHunt 3.4d, Non Classical, Easier
Fetching from uHunt 3.2d, Three+ Nested Loops, Harder
Fetching from uHunt 3.2d, Three+ Nested Loops, Harder
Fetching from uHunt 3.5c, 0-1 Knapsack
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 5.9a, Matrix Power
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 3.3a, Binary Search
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 4.3a, MST, Standard
Fetching from uHunt 3.5c, 0-1 Knapsack
Fetching from uHunt 2.4b, Union-Find Disjoint Sets
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 4.3a, MST, Standard
Fetching from uHunt 3.4b, Involving Sorting, Easier
Fetching from uHunt 4.3a, MST, Standard
Fetching from uHunt 4.3a, MST, Standard
Fetching from uHunt 3.2i, Backtracking (Harder)
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 3.5b, LIS
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 3.5e, TSP
Fetching from uHunt 3.2d, Three+ Nested Loops, Harder
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 3.5c, 0-1 Knapsack
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 6.4a, String Matching, Standard
Fetching from uHunt 4.3a, MST, Standard
Fetching from uHunt 3.3a, Binary Search
Fetching from uHunt 3.3b, Binary Search the Answer
Fetching from uHunt 3.4b, Involving Sorting, Easier
Fetching from uHunt 3.3b, Binary Search the Answer
Fetching from uHunt 3.5a, Max 1D/2D Range Sum
Fetching from uHunt 5.4b, Binomial Coefficients
Fetching from uHunt 3.2d, Three+ Nested Loops, Harder
Fetching from uHunt 8.2b, State-Space, BFS, Easier
Fetching from uHunt 3.2d, Three+ Nested Loops, Harder
Fetching from uHunt 3.3b, Binary Search the Answer
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 8.2b, State-Space, BFS, Easier
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 4.4a, SSSP, BFS, Easier
Fetching from uHunt 3.3b, Binary Search the Answer
Fetching from uHunt 3.3a, Binary Search
Fetching from uHunt 3.2b, Iterative (Two Nested Loops)
Fetching from uHunt 3.4a, Greedy (Classical)
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 3.4a, Greedy (Classical)
Fetching from uHunt 3.2d, Three+ Nested Loops, Harder
Fetching from uHunt 3.4a, Greedy (Classical)
Fetching from uHunt 8.4a, NP-hard/C, small, Easier
Fetching from uHunt 6.4a, String Matching, Standard
Fetching from uHunt 3.4d, Non Classical, Easier
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 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 3.2b, Iterative (Two Nested Loops)
Fetching from uHunt 3.5c, 0-1 Knapsack
Fetching from uHunt 3.5a, Max 1D/2D Range Sum
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 5.4b, Binomial Coefficients
Fetching from uHunt 6.5a, DP String, Classic
Fetching from uHunt 3.3b, Binary Search the Answer
Fetching from uHunt 5.9a, Matrix Power
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 4.4b, SSSP, BFS, Harder
Fetching from uHunt 3.5e, TSP
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 3.3c, Other DnC Problems
Fetching from uHunt 3.2c, Three+ Nested Loops, Easier
Fetching from uHunt 4.4d, SSSP, Dijkstra, Harder
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 2.2d, Sorting, Harder
Fetching from uHunt 3.2b, Iterative (Two Nested Loops)
Fetching from uHunt 3.4b, Involving Sorting, Easier
Fetching from uHunt 3.5a, Max 1D/2D Range Sum
Fetching from uHunt 3.4b, Involving Sorting, Easier
Fetching from uHunt 2.2c, Sorting, Easier
Fetching from uHunt 8.4c, NP-hard/C, special, Easier
Fetching from uHunt 4.4c, SSSP, Dijkstra, Easier
Fetching from uHunt 3.5f, DP level 1
Fetching from uHunt 3.3b, Binary Search the Answer
Fetching from uHunt 6.5a, DP String, Classic
Kattis - 8queens 3.2b, Iterative (Two Nested Loops)
Kattis - a1paper 3.3c, Other DnC Problems
Kattis - acm2 3.4b, Involving Sorting, Easier
Kattis - akcija 3.4b, Involving Sorting, Easier
Kattis - alicedigital 3.5a, Max 1D/2D Range Sum
Kattis - allpairspath 4.5a, APSP, Standard
Kattis - almostunionfind 2.4b, Union-Find Disjoint Sets
Kattis - alphabet 3.5b, LIS
Kattis - anti11 5.4a, Fibonacci Numbers
Kattis - antiarithmetic 3.2b, Iterative (Two Nested Loops)
Kattis - ants 3.4d, Non Classical, Easier
Kattis - aprizenoonecanwin 3.4b, Involving Sorting, Easier
Kattis - arbitrage 4.5b, APSP, Variants
Kattis - arcticnetwork 4.3b, MST, Variants
Kattis - bank 3.4d, Non Classical, Easier
Kattis - batmanacci 5.4a, Fibonacci Numbers
Kattis - beepers 3.5e, TSP
Kattis - bestrelayteam 3.2b, Iterative (Two Nested Loops)
Kattis - bigtruck 8.2d, State-Space, Dijkstra
Kattis - bilateral 8.4c, NP-hard/C, special, Easier
Kattis - blackfriday 3.2b, Iterative (Two Nested Loops)
Kattis - blockcrusher 4.4d, SSSP, Dijkstra, Harder
Kattis - booking 2.2d, Sorting, Harder
Kattis - bumped 8.2d, State-Space, Dijkstra
Kattis - bustour 3.5e, TSP
Kattis - buttonbashing 4.4a, SSSP, BFS, Easier
Kattis - calculatingdartscores 3.2d, Three+ Nested Loops, Harder
Kattis - canonical 3.5d, Coin-Change
Kattis - carefulascent 3.3b, Binary Search the Answer
Kattis - cats 4.3a, MST, Standard
Kattis - ceiling 3.3c, Other DnC Problems
Kattis - chartingprogress 2.2c, Sorting, Easier
Kattis - checkingforcorrectness 5.9a, Matrix Power
Kattis - classrooms 3.4a, Greedy (Classical)
Kattis - classy 2.2d, Sorting, Harder
Kattis - closestpair1 9.clos, Closest Pair Problem
Kattis - closestsums 3.2b, Iterative (Two Nested Loops)
Kattis - closingtheloop 2.2c, Sorting, Easier
Kattis - color 3.4a, Greedy (Classical)
Kattis - commercials 3.5a, Max 1D/2D Range Sum
Kattis - conquestcampaign 4.4b, SSSP, BFS, Harder
Kattis - control 2.4b, Union-Find Disjoint Sets
Kattis - convexhull 7.3a, Polygon, Easier
Kattis - crosscountry 4.4e, SSSP, -ve weight
Kattis - cudoviste 3.2c, Three+ Nested Loops, Easier
Kattis - cups 2.2c, Sorting, Easier
Kattis - cuttingcorners 7.3a, Polygon, Easier
Kattis - cycleseasy 3.5e, TSP
Kattis - destinationunknown 8.2d, State-Space, Dijkstra
Kattis - dobra 3.2i, Backtracking (Harder)
Kattis - drivingrange 4.3a, MST, Standard
Kattis - dungeon 4.4b, SSSP, BFS, Harder
Kattis - dyslectionary 2.2d, Sorting, Harder
Kattis - ecoins 8.2b, State-Space, BFS, Easier
Kattis - election 5.4b, Binomial Coefficients
Kattis - elevatortrouble 8.2b, State-Space, BFS, Easier
Kattis - emptyingbaltic 4.4d, SSSP, Dijkstra, Harder
Kattis - equalsumseasy 8.4a, NP-hard/C, small, Easier
Kattis - errands 3.5e, TSP
Kattis - erraticants 4.4b, SSSP, BFS, Harder
Kattis - europeantrip 8.4c, NP-hard/C, special, Easier
Kattis - exactchange2 3.5d, Coin-Change
Kattis - fallingapart 3.4b, Involving Sorting, Easier
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 - fishmongers 3.4a, Greedy (Classical)
Kattis - flipfive 8.2b, State-Space, BFS, Easier
Kattis - flowerytrails 4.4c, SSSP, Dijkstra, Easier
Kattis - flowfree 8.4a, NP-hard/C, small, Easier
Kattis - foldedmap 3.5a, Max 1D/2D Range Sum
Kattis - font 8.4a, NP-hard/C, small, Easier
Kattis - forests 2.4b, Union-Find Disjoint Sets
Kattis - freckles 4.3a, MST, Standard
Kattis - freeweights 3.3b, Binary Search the Answer
Kattis - fridge 3.4b, Involving Sorting, Easier
Kattis - froshweek2 3.4a, Greedy (Classical)
Kattis - fruitbaskets 3.2i, Backtracking (Harder)
Kattis - fulltank 4.4d, SSSP, Dijkstra, Harder
Kattis - geneticsearch 6.4a, String Matching, Standard
Kattis - george 4.4c, SSSP, Dijkstra, Easier
Kattis - getshorty 4.4c, SSSP, Dijkstra, Easier
Kattis - gettowork 3.4b, Involving Sorting, Easier
Kattis - golombrulers 3.2b, Iterative (Two Nested Loops)
Kattis - grid 4.4a, SSSP, BFS, Easier
Kattis - guess 3.3a, Binary Search
Kattis - height 2.2c, Sorting, Easier
Kattis - horror 4.4a, SSSP, BFS, Easier
Kattis - horrorfilmnight 3.4d, Non Classical, Easier
Kattis - htoo 3.3b, Binary Search the Answer
Kattis - hydrasheads 8.2b, State-Space, BFS, Easier
Kattis - icpcteamselection 3.4b, Involving Sorting, Easier
Kattis - importspaghetti 4.5a, APSP, Standard
Kattis - includescoring 2.2d, Sorting, Harder
Kattis - increasingsubsequence 3.5b, LIS
Kattis - inflagrantedelicto 6.5a, DP String, Classic
Kattis - inflation 3.4a, Greedy (Classical)
Kattis - islandhopping 4.3a, MST, Standard
Kattis - judging 2.2c, Sorting, Easier
Kattis - kastenlauf 4.5b, APSP, Variants
Kattis - knapsack 3.5c, 0-1 Knapsack
Kattis - ladice 2.4b, Union-Find Disjoint Sets
Kattis - lawnmower 2.2c, Sorting, Easier
Kattis - lektira 3.2d, Three+ Nested Loops, Harder
Kattis - lineup 2.2c, Sorting, Easier
Kattis - lockedtreasure 5.4b, Binomial Coefficients
Kattis - longincsubseq 3.5b, LIS
Kattis - loowater 3.4a, Greedy (Classical)
Kattis - lost 4.4b, SSSP, BFS, Harder
Kattis - lostmap 4.3a, MST, Standard
Kattis - mallmania 4.4b, SSSP, BFS, Harder
Kattis - marblestree 3.4d, Non Classical, Easier
Kattis - maximizingyourpay 3.5e, TSP
Kattis - millionairemadness 4.3b, MST, Variants
Kattis - minimumscalar 3.4b, Involving Sorting, Easier
Kattis - minspantree 4.3a, MST, Standard
Kattis - misa 3.2d, Three+ Nested Loops, Harder
Kattis - mjehuric 2.2c, Sorting, Easier
Kattis - muddyhike 4.3b, MST, Variants
Kattis - musicyourway 2.2d, Sorting, Harder
Kattis - naturereserve 4.3b, MST, Variants
Kattis - nikola 3.5f, DP level 1
Kattis - ninepacks 3.5c, 0-1 Knapsack
Kattis - npuzzle 3.2c, Three+ Nested Loops, Easier
Kattis - oceancurrents 4.4b, SSSP, BFS, Harder
Kattis - oddbinom 5.4b, Binomial Coefficients
Kattis - onemorebellmanford 4.4e, SSSP, -ve weight
Kattis - onemorecc 3.5d, Coin-Change
Kattis - orders 3.5c, 0-1 Knapsack
Kattis - pagelayout 3.2i, Backtracking (Harder)
Kattis - pandachess 6.5a, DP String, Classic
Kattis - patuljci 3.2c, Three+ Nested Loops, Easier
Kattis - peg 3.2b, Iterative (Two Nested Loops)
Kattis - permutationdescent 3.5f, DP level 1
Kattis - pet 3.2b, Iterative (Two Nested Loops)
Kattis - pikemaneasy 3.4b, Involving Sorting, Easier
Kattis - planetaris 3.4b, Involving Sorting, Easier
Kattis - plantingtrees 3.4b, Involving Sorting, Easier
Kattis - pokemongogo 3.5e, TSP
Kattis - porpoises 5.9a, Matrix Power
Kattis - powerstrings 6.4a, String Matching, Standard
Kattis - presidentialelections 3.5c, 0-1 Knapsack
Kattis - princeandprincess 6.5a, DP String, Classic
Kattis - pripreme 3.4d, Non Classical, Easier
Kattis - prozor 3.5a, Max 1D/2D Range Sum
Kattis - putovanje 3.2b, Iterative (Two Nested Loops)
Kattis - reactivity 8.4c, NP-hard/C, special, Easier
Kattis - redistribution 3.4b, Involving Sorting, Easier
Kattis - reduction 3.2b, Iterative (Two Nested Loops)
Kattis - register 3.2b, Iterative (Two Nested Loops)
Kattis - rijeci 5.4a, Fibonacci Numbers
Kattis - robotprotection 7.3a, Polygon, Easier
Kattis - roompainting 3.3a, Binary Search
Kattis - safe 8.2b, State-Space, BFS, Easier
Kattis - safehouses 3.2c, Three+ Nested Loops, Easier
Kattis - scrollingsign 6.4a, String Matching, Standard
Kattis - secretchamber 4.5b, APSP, Variants
Kattis - sellingspatulas 3.5a, Max 1D/2D Range Sum
Kattis - set 3.2c, Three+ Nested Loops, Easier
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 - simplicity 3.4d, Non Classical, Easier
Kattis - sixdegrees 4.4b, SSSP, BFS, Harder
Kattis - skocimis 3.4d, Non Classical, Easier
Kattis - slikar 4.4b, SSSP, BFS, Harder
Kattis - smallschedule 3.3b, Binary Search the Answer
Kattis - sortofsorting 2.2d, Sorting, Harder
Kattis - speed 3.3b, Binary Search the Answer
Kattis - spiderman 3.5f, DP level 1
Kattis - spiral 4.4a, SSSP, BFS, Easier
Kattis - squarepegs 3.4a, Greedy (Classical)
Kattis - squawk 5.9a, Matrix Power
Kattis - stringmatching 6.4a, String Matching, Standard
Kattis - subway2 4.4c, SSSP, Dijkstra, Easier
Kattis - suspensionbridges 3.3b, Binary Search the Answer
Kattis - swaptosort 2.4b, Union-Find Disjoint Sets
Kattis - sylvester 3.3c, Other DnC Problems
Kattis - synchronizinglists 2.2c, Sorting, Easier
Kattis - tautology 3.2d, Three+ Nested Loops, Harder
Kattis - teacherevaluation 3.4d, Non Classical, Easier
Kattis - telephones 3.2b, Iterative (Two Nested Loops)
Kattis - textmessaging 3.4b, Involving Sorting, Easier
Kattis - ticketpricing 3.5f, DP level 1
Kattis - tourdefrance 3.2b, Iterative (Two Nested Loops)
Kattis - trainsorting 3.5b, LIS
Kattis - transportationplanning 4.5a, APSP, Standard
Kattis - virtualfriends 2.4b, Union-Find Disjoint Sets
Kattis - visualgo 4.4d, SSSP, Dijkstra, Harder
Kattis - weightofwords 3.5f, DP level 1
Kattis - wine 4.4d, SSSP, Dijkstra, Harder
Kattis - woodcutting 3.4b, Involving Sorting, Easier
Kattis - xyzzy 4.4e, SSSP, -ve weight