Implement RLE compression of a string: given an array of English alphabet characters, compress it so that repeated characters are recorded once, followed by the count of repetitions. For example: AAAABBBAAA → A4B3A3.