We selected a few problems, which we think are good training material for programming contests.
Hide chapter hint.
| chapter | problem | judge |
|---|---|---|
| anagrams | Anagram verifier | [spoj:ANGRAM] |
| arithm expr eval | Boolean Logic | [spoj:BOOLE] |
| arithm expr eval | Arithmetic Expressions | [spoj:AREX] |
| arithm expr eval | Cells | [spoj:IPCELLS] |
| bellman ford | Negative Cycles | [spoj:NEGCYC] |
| bfs | Hike on a Graph | [spoj:HIKE] |
| bfs | Prime Path | [spoj:PPATH] |
| biconnected components | Police Query | [spoj:POLQUERY] |
| binary search | Fill the cisterns | [spoj:CISTFILL] |
| binary search | Egg Drop | [gcj:eggdrop] |
| bipartite matching | Crime Wave | [icpcarchive:5584] |
| bipartite matching | Dungeon of Death | [spoj:QUEST4] |
| bipartite matching | Muddy Fields | [spoj:MUDDY] |
| bipartite matching | Mission Improbable | [kattis:improbable] |
| closest points | Closest Point Pair | [spoj:CLOPPAIR] |
| closest points | Closest Triplet | [spoj:CLOSEST] |
| connected components | The Ant | [spoj:ANTTT] |
| connected components | Lego | [spoj:LEGO] |
| conseils | Frosting on the Cake | [icpcarchive:8154] |
| convex hull | Doors and Penguins | [spoj:DOORSPEN] |
| convex hull | Build the Fence | [spoj:BSHEEP] |
| convex hull | Blowing Candles | [icpcarchive:8155] |
| dancing links | Sudoku | [spoj:SUDOKU] |
| dancing links | Making Jumps | [spoj:MKJUMPS] |
| data 1d | Unique Encryption Keys | [icpcarchive:5881] |
| dfs | ABC Path | [spoj:ABCPATH] |
| dfs | A Bug’s Life | [spoj:BUGLIFE] |
| dijkstra | Mice and Maze | [spoj:MICEMAZE] |
| dijkstra | Dragon Maze | [gcj:China2014roundB] |
| dilworth | Reservations of taxis | [kattis:taxicab] |
| dilworth | Stock Charts | [gcj:2009round2C] |
| dilworth | Taxi Cab Scheme | [icpcarchive:3126] |
| dinic | Fast Maximum Flow | [spoj:FASTFLOW] |
| dist grid | A Famous Grid | [spoj:SPIRALGR] |
| input output | Enormous Input Test | [spoj:INTEST] |
| eratosthene | The Spiral of Primes | [icpcarchive:2120] |
| eratosthene | Prime or Not | [spoj:PON] |
| eratosthene | Bazinga! | [spoj:DCEPC505] |
| eulerian tour | Goldbach graphs | [spoj:GOLDG] |
| eulerian tour | Free Tour | [spoj:FTOUR] |
| fast exponentiation | The last digit | [spoj:LASTDIG] |
| fast exponentiation | Tiling a Grid With Dominoes | [spoj:GNY07H] |
| floyd warshall | Roads in Berland | [spoj:CT25C] |
| ford fulkerson | Potholers | [spoj:POTHOLE] |
| ford fulkerson | Maximum Flow | [spoj:FLOW] |
| gale shapley | Stable Marriage Problem | [spoj:STABLEMP] |
| gauss jordan | Ars Longa | [icpcarchive:3563] |
| gauss jordan | Linear Equation Solver | [spoj:LINQSOLV] |
| greedy | Minimum Scalar Product | [gcj:2008round1A] |
| greedy | Minimal Coverage | [timus:1303] |
| graph01 | KATHTHI | [spoj:KATHTHI] |
| huffman | Huffman Trees | [poj:1261] |
| huffman | Variable Radix Huffman Encoding | [spoj:VHUFFM] |
| intervals cover | Radar Installation | [onlinejudge:1193] |
| intro | It can be arranged | [kattis:itcanbearranged] |
| intro | Ricochet Robots | [kattis:ricochetrobots] |
| k-sum | 4 Values whose Sum is 0 | [poj:2785] |
| kadane | Maximum Sum Sequences | [spoj:MAXSUMSQ] |
| kadane | Largest Rectangle | [codechef:LARGEST] |
| knapsack | The Knapsack Problem | [spoj:KNAPSACK] |
| knapsack | Knapsack | [spoj:KNPSACK] |
| knuth morris pratt | Find the maximal product of string prefixes | [codility:carbo2013] |
| knuth morris pratt | A Needle in the Haystack | [spoj:NHAY] |
| knuth morris pratt | Power strings | [kattis:powerstrings] |
| knuth morris pratt | Period | [spoj:PERIOD] |
| kruskal | Cobbled streets | [spoj:CSTREET] |
| kruskal | Minimum Spanning Tree | [spoj:MST] |
| kuhn munkres | Selfish Cities | [spoj:SCITIES] |
| levenshtein | Philosophers Stone | [spoj:BYTESM2] |
| levenshtein | Edit distance | [spoj:EDIST] |
| levenshtein | Advanced Edit Distance | [spoj:ADVEDIST] |
| longest common subsequence | Longest Common Substring | [spoj:LCS] |
| longest increasing subsequence | Easy Longest Increasing Subsequence | [spoj:ELIS] |
| lowest common ancestor | Lowest Common Ancestor | [spoj:LCA] |
| manacher | Longest Palindromic Substring | [spoj:LPS] |
| manacher | Casting Spells | [kattis:castingspells] |
| matrix chain mult | Mixtures | [spoj:Mixtures] |
| matrix chain mult | The Safe Secret | [kattis:safesecret] |
| matrix chain mult | Sweet and Sour Rock | [spoj:ROCK] |
| merge ordered lists | Mergesort | [spoj:MERGSORT] |
| min cut | Landscaping | [kattis:landscaping] |
| min cut | Coconuts | [spoj:COCONUTS] |
| min mean cycle | Word Rings | [spoj:WORDRING] |
| next permutation | The Next Permutation | [spoj:NEXT] |
| next permutation | Great Swerc | [spoj:SWERC14A] |
| shortest paths variants | Almost Shortest Path | [spoj:SAMER08A] |
| shortest paths variants | Flowery Trails | [kattis:flowerytrails] |
| longest path in tree | Labyrinth | [spoj:LABYR1] |
| longest path in tree | Longest path in a tree | [spoj:PT07Z] |
| longest path in tree | SpeedCameras | [codility:calcium2015] |
| polygon | Toil for Oil | [spoj:OIL] |
| predictive text | T9 | [poj:1451] |
| dynamic programming | Fibonacci Sum | [spoj:FIBOSUM] |
| rabin karp | Longest Common Substring | [spoj:LCS] |
| range minimum query | Negative Score | [spoj:RPLN] |
| rectangles from histogram | Largest Rectangle in a Histogram | [spoj:HISTOGRA] |
| rectangles from histogram | Galerie d'art | [prologin:2012:galerie] |
| rectangles from points | Rectangle | [spoj:HMSRECT] |
| squares from grid | Making Chess Boards | [spoj:CT101CC] |
| strongly connected components | Capital City | [spoj:CAPCITY] |
| structures | Encryption | [spoj:CENCRY] |
| structures | Phone List | [spoj:PHONELST] |
| structures | A concrete simulation | [spoj:ACS] |
| structures | Havannah | [gcj:2013round3B] |
| subsetsum | Boat Burglary | [spoj:BURGLARY] |
| sudoku | Easy sudoku | [spoj:EASUDOKU] |
| sweepline | Back to the future | [prologin:demi2012] |
| topological order | Topological Sorting | [spoj:TOPOSORT] |
| topological order | Project File Dependencies | [spoj:PFDEP] |
| topological order | All Disks Considered | [spoj:ALL] |
| traveling salesman | Small TSP | [spoj:STSP] |
| traveling salesman | Collecting Beepers | [kattis:beepers] |
| traveling salesman | Menu tour | [spoj:MENUTOUR] |
| sorting | Spelling Lists | [spoj:MIB] |
| sorting | Yodaness Level | [spoj:YODANESS] |
| trie | Spell checker | [icpcarchive:3872] |
| two sat | Manhattan | [kattis:manhattan] |
| two sat | Soldiers on Parade | [spoj:SOPARADE] |
| union disjoint rectangles | City Park | [icpcarchive:6889] |
| windows k distinct | Épiphanie | [prologin:2011:epiphanie] |