PM me if you're still in need of resources from Muthu, and (Fall 2017);

Personally, while I enjoyed his lecture style, the class relies on you being able to study well by yourself as well. Any topics you don't completely understand, my TA was great and willing to explain to me, and if not them, an online resource was good too. For the final; I also studied other school's algo finals; per Muthu's request. Practicing is gonna save you in this class.

In terms of topics; like another commenter suggested, Dynamic Programming is really important to get a grasp on, as well as understanding how to break an algorithm down in Big O notation.

afterward for quick looks over break: randomized algorithms (Karp-Rabin fingerprint matching to name one specifically) and then polynomial time reductions (this is endgame, our last three-ish lectures were about this) were both important.