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