Problem description: Visit and Support LintCode Search via Difficulty: Medium Tags: LintCode, Depth-First Search, O(k * C(n, k)), O(k), Medium ProblemSolutionCodeProblem