443. String Compression | LeetCode Challenge | DSA for Beginners 👨‍💻

Given an array of characters chars, compress it using the following algorithm:

Begin with an empty string s. For each group of consecutive repeating characters in chars:

If the group's length is 1, append the character to s.
Otherwise, append the character followed by the group's length.
The compressed string s should not be returned separately, but instead, be stored in the input character array chars. Note that group lengths that are 10 or longer will be split into multiple characters in chars.

After you are done modifying the input array, return the new length of the array.

You must write an algorithm that uses only constant extra space.


Problem Link: https://leetcode.com/problems/string-compr...

📌 Support the Channel: If you found this video helpful, please give it a LIKE 👍 and share your thoughts or questions in the COMMENTS below!

🔔 Subscribe for more daily DSA problems


I'm learner like you and I've trying the best possible solution with simplest way to deliver with you. if you have suggestion or solution please share and comment that would be great🙌.



#dsavlogs #javascript #react #coding #dsa #java #algorithms #programming #leetcode #linkedlist #webdevelopment #codinginterview #practice #learning