Competitive Programming ⸱ Week 02

This lecture is based on the Trouble Sort problem (Google Code Jam 2018 Qualifiers, Problem A), and you can find a link to it here.

This would have been a straightforward implementation problem, except that the direct implementation is too expensive! Thinking of Trouble Sort in terms of another familiar sorting algorithm (with an almost rhyming name) and then disregarding both of these algorithms altogether leads to the final solution :)

The code discussed in the video can be found here.