String Compression - Leetcode 443 - Python
Leetcode Daily Challenge - March 02, 2023
Leetcode 443. String Compression - Python Solution
Solution URL: https://leetcode.com/problems/string-...
Problem Statement
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.
==============================================
Support the channel by subscribing and hitting the like button.
Litcode Playlist: https://bit.ly/3uGBSHx
LinkedIn: / sachin-singh-ss31
Email: sachinsingh31@outlook.com
#leetcode #leetcodesolution #leetcodedailychallenge #codingpractice #learnpython #python #googleinterview #amazoninterviewpreparation
On this page of the site you can watch the video online String Compression - Leetcode 443 - Python with a duration of hours minute second in good quality, which was uploaded by the user Lit Code 02 March 2023, share the link with friends and acquaintances, this video has already been watched 18,494 times on youtube and it was liked by 125 viewers. Enjoy your viewing!
