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
На этой странице сайта вы можете посмотреть видео онлайн String Compression Leetcode(Medium) in JAVA | Explanation and Code длительностью часов минут секунд в хорошем качестве, которое загрузил пользователь Pepcoding 29 Сентябрь 2020, поделитесь ссылкой с друзьями и знакомыми, на youtube это видео уже посмотрели 62,145 раз и оно понравилось 1.1 тысяч зрителям. Приятного просмотра!
