String Compression Leetcode(Medium) in JAVA | Explanation and Code

Publicado el: 29 septiembre 2020
en el canal de: Pepcoding

62,145

1.1k

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

En esta página del sitio puede ver el video en línea String Compression Leetcode(Medium) in JAVA | Explanation and Code de Duración hora minuto segunda en buena calidad , que subió el usuario Pepcoding 29 septiembre 2020, comparta el enlace con amigos y conocidos, en youtube este video ya ha sido visto 62,145 veces y le gustó 1.1 mil a los espectadores. Disfruta viendo!

1,090