you start with the top string, for each character you havent already used, you find the closest copy of that character, and you repeatedly travel the distance between them until you dont land on that letter again
so the first two A's are 2 char movements apart, so you keep moving 2 chars at a time until you reach a char that isnt A
then you do that starting with the B instead, then you skip the next A cause you used it for the first A, so you move onto C, etc
final output is the number of copies of that letter in each run like that so itd be 4,3,2,2,2
rn im working on a similar (self imposed) challenge thats similar to that but instead of grabbing the nearest one, it tries to match with the last one it can, and then as many equidistant copies in between
so A.A.AAA...A becomes uhh
A A A
A A A
ignoring the like, spaces / dots or whatever
not cause they wouldnt be included i just dont feel like
I still don't know why <%> (and others) work too. There is no file on TIO called %, but there is one called ., so it makes sense that that works now
You can also do <&> or all sorts of combinations.
Or even <@!>, it doesn't have to only be one long
I saw in some docs that if glob receives an argument with no * or some other symbols, it simply returns it (but not an empty string). You can see if you do <%*>, it will always return empty.
Security tip: To prevent piracy of software you write, do it in Rust. The built in ownership checking will ensure only one person can own a copy at once.
@RadvylfPrograms Security tip: To prevent piracy, write your software in Jelly. There's only like 10 people on the planet who can read it, so it's easy to figure out who pirated it
@RadvylfPrograms or you could just pirate it yourself before anyone else does. That way, no one else will pirate it because the work has already been done for them.
