python solution
Take the hit and find all permutations that match the combinationLength\n```\nclass CombinationIterator:\n\n    def init(self, characters: str, combinationLengt
Take the hit and find all permutations that match the combinationLength\n```\nclass CombinationIterator:\n\n    def __init__(self, characters: str, combinationLength: int):\n        perm = [characters[0]]\n        \n        for char in characters[1:]:\n            N = len(perm)\n            for i in range(N):\n                perm.append(perm[i]+char)\n            perm.append(char)\n            \n        self.comboList = sorted([s for s in perm if len(s)==combinationLength])\n        \n        \n    def next(self) -> str:\n        return self.comboList.pop(0)\n        \n\n    def hasNext(self) -> bool:\n        if self.comboList: return True\n        return False
['Python', 'Python3']