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

Published: 29 September 2020
on channel: 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

On this page of the site you can watch the video online String Compression Leetcode(Medium) in JAVA | Explanation and Code with a duration of hours minute second in good quality, which was uploaded by the user Pepcoding 29 September 2020, share the link with friends and acquaintances, this video has already been watched 62,145 times on youtube and it was liked by 1.1 thousand viewers. Enjoy your viewing!

1,090