e351dfc7 4 problems, 90 min: - 2 easy (array manip, string proc): ~20 min total - 1 hard: graph shortest path variant - 1 medium: DP finished 3/4.
