How to Win Coding Competitions: Secrets of Champions is the title of an online course offered by the ITMO university on edX.
Here is what the course is about:
Enhance programming skills to boost your career and win prizes led by ITMO University, the only 6-time winner of the world’s top coding cup.
The course starts on October 2016, so be sure to bookmark it. As usual on edX the course is free unless you want to purchase a verified certificate which is optional.
Check out Clash of Codes on CodinGame. It’s a coding battle with a duration of either 5 or 10 minutes. Up to 8 players will try to submit their solution as fast as possible. Another mode is to submit the shortest solution, i.e. submit code with the least number of characters.
In this blog post we’ll learn how to read a file as input and write the output to a file using redirection. Continue reading
Below are implementations of the Ford-Fulkerson algorithm to compute the maximum flow in a graph with integer capacities. Breadth first search is used to find paths from the source to the target which makes this the Edmonds-Karp algorithm. To learn about this topic I recommend reading the references. Continue reading
Check out this set of videos by Brian Dean that explain solutions to well known dynamic programming problems. This includes the longest increasing subsequence, knapsack problem and maximum value contiguous subsequence.
Suppose you are given the following input:
5 22 9 813 13
77 98 93 51
5 3 1 5 7 1 3
Your task is to print out the sum of the numbers in each line, e.g. the sum for the first line is
5 + 22 + 9 + 813 + 13 = 862
So the output should be:
The problem here is that you don’t know how many lines you are given and how many numbers there are in each line. How can you solve this problem in Python and C++?