String Compression Leetcode(Medium) in JAVA | Explanation and Code
Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that.
NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this video, we discuss the String Compression problem and explain the solution with the concepts of Strings and String builders. In this problem,
1. You are given a string.
2. You have to compress the given string in the following two ways -
First compression - The string should be compressed such that consecutive duplicates of characters are replaced with a single character.
For "aaabbccdee", the compressed string will be "abcde".
Second compression - The string should be compressed such that consecutive duplicates of characters are replaced with the character and followed by the number of consecutive duplicates.
For "aaabbccdee", the compressed string will be "a3b2c2de2".
To attempt and submit this question, click here: https://www.pepcoding.com/resources/o...
For a better experience and more exercises, VISIT:
Have a look at our result:
Follow us on our FB page: / pepcoding
Follow us on Instagram: / pepcoding
Follow us on LinkedIn: / pepcoding-education
In questa pagina del sito puoi guardare il video online String Compression Leetcode(Medium) in JAVA | Explanation and Code della durata di ore minuti seconda in buona qualità , che l'utente ha caricato Pepcoding 29 settembre 2020, condividi il link con amici e conoscenti, su youtube questo video è già stato visto 62,145 volte e gli è piaciuto 1.1 mille spettatori. Buona visione!
