I missed the discussion, because I was busy. I would be happy to clarify the statement, but I need your help to understand, which parts of the statement are unclear and what you would expect.
As I have seen from your discussion, it looks like, that the iterative part of the compression is unclear. Maybe you can comment what you would expect in the statement.
The second thing I have seen, is the punctuation. This should be explained in rule 2, but I can adjust it, if it is unclear.
Itâs the same question I asked during validation, the rules arenât clear enough about âchain compressionsâ. With the example given above âindolore dolor doloreâ.
âdolorâ has 2 matches, the sentence becomes âin/1e dolor /1eâ.
Then â/1eâ has one match and the sentence becomes âin/2 dolor /1eâ.
Therefore âdoloreâ is never indexed as is, even though thatâs what people naturally expect.
Punctuation needs to be clarified (e.g. âwe only consider words containing alphabetical characters, all other characters are left as isâ).
Guess work involved in which words to index when.
In addition, consider the following case: âabc cdef abcdefâ.
The algorithm proposed in the solution gives âabc cdef /0defâ, when a more efficient compression would be âabc cdef ab/1â. This is explained by âthe iterative nature of the compressionâ. But this appears absolutely nowhere in the puzzle description.
I added a section of âAssumptionsâ in the statement, with the purpose to clarify plenty of âyou ought to have knownâ properties which initially I did not know at all.