University stuff.
您最多选择25个主题 主题必须以字母或数字开头,可以包含连字符 (-),并且长度不得超过35个字符

123
  1. My solution is around O(n^2). Most of my solutions include looping over
  2. the tasks, then in said loop, loop over either all tasks or a subset of
  3. the tasks.