Timeline for Print a string in as few distinct characters as possible
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 6, 2021 at 16:27 | comment | added | seshoumara | @user41805 I just found a shorter version, by dealing with the letter 'o' directly as 111P. I'll continue to look for improvements to a 3 char dc solution. | |
| Feb 6, 2021 at 16:25 | history | edited | seshoumara | CC BY-SA 4.0 | shorter version |
| Feb 6, 2021 at 11:38 | comment | added | user41805 | These were the three bytes I too had. Since the tiebreaker for two solutions with the same number of unique chars is the bytecount (for both the challenge itself as well as the bounty), you can still shorten your solution. | |
| Feb 6, 2021 at 10:46 | history | answered | seshoumara | CC BY-SA 4.0 |