Learn all about the Standard Template Library (STL) from the great Stephan T. Lavavej (STL), Microsoft’s keeper of the STL cloth (this means he manages the partnership with the owners of STL and Microsoft, including, of course, bug fixes and enhancements to the STL that ships as part of Visual C++).

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.

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.