{"blocks": [{"key": "d0f86980", "text": "Question", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "6ff02878", "text": "Design an algorithm that compresses a string by replacing consecutive repeating characters with the character followed by the repeat count (e.g., \"aaabbc\" \u2192 \"a3b2c1\").", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "cd679e1b", "text": "Describe the compression and decompression procedures.", "type": "unordered-list-item", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "239b2572", "text": "Specify how you would handle edge cases such as single-character runs, very long inputs, or cases where compression makes the string longer.", "type": "unordered-list-item", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "55ace8c0", "text": "Provide Big-O time and space complexity analysis.", "type": "unordered-list-item", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}], "entityMap": {}}