Easy Python Solution | Faster than 84%
\nclass Solution:\n    def divideString(self, s: str, k: int, fill: str) -> List[str]:\n        ans = []\n        no_of_groups = math.ceil(len(s)/k)\n        st
```\nclass Solution:\n    def divideString(self, s: str, k: int, fill: str) -> List[str]:\n        ans = []\n        no_of_groups = math.ceil(len(s)/k)\n        start = 0\n        while no_of_groups>0:\n            if s[start:start+k]:\n                ans.append(s[start:start+k])\n            else:\n                ans.append(s[start:])\n            start+=k\n            no_of_groups-=1\n        while len(ans[-1])!=k:\n                ans[-1]+=fill           \n        return ans\n```
['Python', 'Python3']