There is a new version of the TopCoder Java Applet, see also here for instructions. If the file extension “jnlp” is not recognized, follow the instructions here.
If you added the “bin” java folder to the system path variable, then you can open the “jnlp” via the Windows terminal as follows:
Via reddit I found these books for coding interviews:
1. Cracking the coding interview
2. Elements of programming . You can check out the PDF samples.
1. CTCI vs EPI? (reddit)
2. Any tips for the LeetCode grind? (reddit)
3. How I went from failing every interview to a job at Amazon (article by Reginald Long)
Via reddit I discovered the platform Firecode.io on which you can practice solving algorithmic problems. The peculiar thing about this platform is the repetition of problems that helps you memorize strategies.
So far, I really like it, and I recommend it.
Here are two free books on competitive programming:
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 these Channel 9 lectures by Stephan T. Lavavej on the Standard Template Library (STL) in C++.
From the website’s description:
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.
Abstract
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.
Programming, algorithms and data structures 