[Programmers] String Compression

https://programmers.co.kr/learn/courses/30/lessons/60057

Solution

You can approach the string like an N-gram Language Model.

1
def get_len(n):
2
  for i in range(cut, length of string, cut):
3
    check string, counting
4
  handle last count
5

6
for i in range(0, len(s) // 2 + 1):
7
  get_len(i)

String check and counting:

• Compare s[i : i + cut] with the current temporary storage
  • If they match, increment the count
  • If they differ, update the output result

Following the pseudo code as-is, the last chunk of characters won’t be handled inside the for loop. Handle the counting for the last string chunk outside the loop.

Code

https://github.com/naem1023/codingTest/blob/master/implementation/pg-60057.py