function compressStr(str) {
	var output = "", // will return this variable as final compressed string
		currChar = "", // represents current character being looked at
		currCount = "", // counts number of times character is repeated
		maxCount = ""; // maximum count


}
@@ -1,8 +1,98 @@
+// Method that performs basic string compression using the counts of repeated characters%0A%0A
 function
@@ -220,16 +220,8 @@
 nts 
-current 
 char
@@ -230,23 +230,38 @@
 ter 
-being looked at
+we are searching for in string
 %0A%09%09c
@@ -358,10 +358,617 @@
  count%0A%0A
+%09for (i = 0; i %3C str.length; i++) %7B%0A%09%09// if the character we are searching for in string matches the character being looked at%0A%09%09if ( currChar !== str%5Bi%5D) %7B%0A%09%09%09output = output + currChar + currCount; // output is sum of the output we have so far plus the character we have been searching for in our string plus the number of times that character is repeated%0A%09%09%09maxCount = Math.max(maxCount, currCount); // choose the larger value between maxCount and currCount%0A%09%09%09currChar = str%5Bi%5D; // move on to the next character%0A%09%09%09currCount = 1; // count resets to 1 since we have moved on to the next character%0A%09%09%7D%0A%09%7D%0A
 %0A%7D

Write what happens when we are searching for doesn't match the character in the string being looked at