This is an answer-chaining post, so in this challenge every answer (except the first answer) depends on the previous answer.
The goal of this challenge is to output the restricted characters. The restricted characters are the most common
n - 1 characters of all answers, if happens to be a tie, then the characters with the lowest UTF-8 range is restricted.
The max bytes for every answer is:
n is answer number.
The answers only output the restricted characters, no newlines, no other characters like that.
- The code may output the restricted characters exactly once, in any order.
Standard loopholes are forbidden by default.
No answerer may answer twice in a row.
No languages may be reused in the last 5 answers.
Every answer takes empty or no input, and outputs to STDOUT.
The wrong answers (that break rules or don't do that this challenge say) are completely ignored if this answer is 10 minutes old, and should be deleted.
The last answer after 5 days of the challenge not getting answers wins.
# 1: Python 3, 13 bytes
Next charset: `"` [link]()
The second answer should output
". If the second answer's code is
ppaaa, then the third answer should output either
ap (because these are the most common characters in all answers), and doesn't use these characters.
Note: The scoring formula is based on the byte count and the answer number. The goal is to output the restricted characters efficiently while adhering to the specified byte limits.
Have a great day!
- The banned character set is the N most common characters of the concatenation of all answers.