Bored by the academic approach of most data structures and algorithms courses? This is for you! You'll learn to solve algorithms and analyze space and time complexity in both an interview setting and in your day-to-day development. Following along with the course, you'll practice algorithms with common interview questions using a handful of algorithm techniques. Take a practical look at recursion and learn to optimize your solutions using divide-and-conquer. Implement merge sort and quicksort and understand the tradeoffs of both approaches. Plus, get started with dynamic programming and memorization!

In the Alekhine Defence, contrary to the classical methods of playing in the opening, Black does not fight for the centre with his pawns, but begins to exert immediate pressure against White’s centre. Black’s knight on f6 attacks the pawn on e4, and if it advances, then Black’s d-pawn joins into the attack against it. The Alekhine Defence is particularly applicable in encounters against players who are inferior in class, as well as in games with a short time-control. This opening is not used so often in practice, so your opponent might lose plenty of time to recollect the opening theory. That might prove to be a very negative factor for him in the forthcoming fight.