prompt3.txt

Write an algorithm that takes a string with repeated characters and compresses them, using a number to show how many times the repeated character has been compressed. For instance, aaa would be written as 3a. Solve the problem with and without recursion.

Example
Input: "aaabccdddda"

Output: "3ab2c4da"

__________________________________________________________________

input - string of letters
special characters or numbers?

output - string of numbers & letters

w recursion
w.o recursion

for loop
string > array.from > string .join
empty result string > .concat +


WITHOUT RECURSION:

const stringCompression = (input) => {
  const string = input.toLowerCase();
  let result = "";
  let counter = 1;
  for (let i=0; i < string.length; i++) {
    let currentChar = string[i];
    let nextChar = string[i + 1];
    if (currentChar === nextChar) {
      counter++;
    } else if (counter === 1) {
      result += currentChar;
    } else {
      result += counter + currentChar;
      counter = 1;
    }
  }
  return result;
};


WITH RECURSION:

const stringCompression = (string) => {

};


string = "aaabccdddda";
result = "3ab2c4da";