# TC CsCourses

Compute the lexicographically-minimal way to graduate! A relatively straightforward dynamic programming problem with backtracking. A little thinking gets the time down to ${\displaystyle O(n^{4})}$ which is enough for ${\displaystyle n=50}$.