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
In questa pagina del sito puoi guardare il video online String Compression - Leetcode 443 - Python della durata di ore minuti seconda in buona qualità , che l'utente ha caricato Lit Code 02 marzo 2023, condividi il link con amici e conoscenti, su youtube questo video è già stato visto 18,494 volte e gli è piaciuto 125 spettatori. Buona visione!
