String Compression — LeetCode

Published: 29 May 2026
on channel: Benabub

Description
Step-by-step algorithm visualization for LeetCode #443 (String Compression). The solution uses an end pointer to scan contiguous groups and a write pointer to compress the array in-place. When a new group is detected or the array ends, the character is written, followed by the group count digits if the count exceeds one.

Complexity Analysis:
Time Complexity: O(n) — each character is visited once by the end pointer, and the write pointer writes each compressed character and digit at most once.
Space Complexity: O(1) — compression is performed in-place using only integer variables.

Timestamps:
0:00 — Problem Setup
0:14 — Main Cycle
2:50 — Final Write Position & Return

Resources:
Telegram: https://t.me/benabub_algoviz
GitHub: https://github.com/benabub
Support channel: https://boosty.to/benabub

On this page of the site you can watch the video online String Compression — LeetCode with a duration of hours minute second in good quality, which was uploaded by the user Benabub 29 May 2026, share the link with friends and acquaintances, this video has already been watched 4 times on youtube and it was liked by 0 viewers. Enjoy your viewing!

158