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
На этой странице сайта вы можете посмотреть видео онлайн String Compression - Leetcode 443 - Python длительностью часов минут секунд в хорошем качестве, которое загрузил пользователь Lit Code 02 Март 2023, поделитесь ссылкой с друзьями и знакомыми, на youtube это видео уже посмотрели 18,494 раз и оно понравилось 125 зрителям. Приятного просмотра!
