Simple challenge inspired by the popularity of my previous print invisible text and print real invisible text challenges, and the same length different string challenge.
Given a string consisting of only printable characters (0x20 to 0x7E
), print every printable character not present in the string.
Input
A string, or array of characters, consisting of only printable ASCII characters
Output
Every printable ASCII character not present in the input string, in any order.
Testcases
Input: "Hello, World!"
Output: ""#$%&'()*+-./0123456789:;<=>?@ABCDEFGIJKLMNOPQRSTUVXYZ[\]^_`abcfghijkmnpqstuvwxyz{|}~"
========
Input: "Hi!"
Output: " "#$%&'()*+,-./0123456789:;<=>?@ABCDEFGIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghjklmnopqrstuvwxyz{|}~"
========
Input: ""
Output: " !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~"
========
Input: " !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~"
Output: ""
Scoring
This is code-golf so fewest bytes in each language wins
set( 'a', 'b', 'c' )
\$\endgroup\$