{"dataset": "bigcode_python_code", "docid": "", "text": "class Solution(object):\n    def combine(self, n, k):\n        \"\"\"\n        :type n: int\n        :type k: int\n        :rtype: List[List[int]]\n        \"\"\"\n        paths = []\n        self.recursive(n, k, 1, [], paths)\n\n        return paths\n\n    def recursive(self, n, k, start_index, path, paths):\n        if k == 0:\n            paths.append(path)\n\n            return None\n\n        for i in range(start_index, n + 1):\n            self.recursive(n, k - 1, i + 1, path + [i], paths)\n\n        return None", "metadata": "{\"size\": 496, \"lang\": \"Python\", \"max_stars_repo_path\": \"leetcode/77_combinations/77_combinations.py\", \"max_stars_repo_name\": \"ryangillard/misc\", \"avg_line_length\": 22.5454545455, \"max_line_length\": 62, \"alphanum_fraction\": 0.4697580645, \"__id__\": 9125049, \"nl_ratio\": 0.09879032258064516}", "reason": "", "annotator": "", "campaign": "", "timestamp": "2023-04-08 07:03:31.295071"}