This solution doesn't need to reconstruct the counts.

        stack = []
        for c in s:
            if stack and stack[-1][-1] == c:
                stack[-1] += c
            else:
                stack.append(c)
            
            if stack and len(stack[-1]) == k:
                stack.pop()

        return "".join(stack)