Problem description: Visit and Support LeetCode Search via Difficulty: Medium Tags: LeetCode, Greedy, O(n), O(1), Medium ProblemSolutionCodeProblem