DSA - Level 1 - 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/online-java-foundation/string,-string-builder-and-arraylist/string-compression-official/ojquestion For a better experience and more exercises, VISIT: https://www.pepcoding.com/resources/online-java-foundation Have a look at our result: https://www.pepcoding.com/placements Follow us on our FB page: https://www.facebook.com/pepcoding Follow us on Instagram: https://www.instagram.com/pepcoding Follow us on LinkedIn: https://www.linkedin.com/company/pepcoding-education