Introduction

Every string has an "alphabet", composed of the characters that make it up. For example, the alphabet of $$\abcaabbcc\$$ is $$\{a, b,c}\$$. There are two operations you can do with alphabets: getting the alphabet of a string, and seeing if another string has a given alphabet.

Challenge

Given two strings, you must write a function that finds the alphabet of the first string, and returns a truthy or falsy value based on whether that alphabet makes up the second string, ie. if the alphabet of the first string is the same as that of the second. However, the function should also return a truthy value if the alphabet of the first string is a superset of, or contains, the alphabet of the second.

• The two strings will be of variable length. They might be empty. If they are, their alphabets are considered and empty list/set. Any valid unicode string could be an input.
• The function must return a truthy or falsy value. Any type of output is OK, as long as, when converted to a boolean in your language (or the equivalent), it is true.

Examples

• String 1: "abcdef", String 2: "defbca"
Output: truthy
• String 1: "abc", String 2: "abc123"
Output: falsy
• String 1: "", String 2: ""
Output: truthy
• String 1: "def", String 2: "abcdef"
Output falsy
• String 1: "abcdef", String 2: "abc"
Output truthy
• String 1: "😀😁😆", String 2: "😁😆😀"
• Output: truthy

Rules

This is , so shortest answer in bytes wins!

The Catalogue

The Stack Snippet at the bottom of this post generates the catalogue from the answers a) as a list of shortest solution per language and b) as an overall leaderboard.

## Language Name, N bytes


where N is the size of your submission. If you improve your score, you can keep old scores in the headline, by striking them through. For instance:

## Ruby, <s>104</s> <s>101</s> 96 bytes


If there you want to include multiple numbers in your header (e.g. because your score is the sum of two files or you want to list interpreter flag penalties separately), make sure that the actual score is the last number in the header:

## Perl, 43 + 2 (-p flag) = 45 bytes


You can also make the language name a link which will then show up in the snippet:

## [><>](https://esolangs.org/wiki/Fish), 121 bytes


/* Configuration */

var QUESTION_ID = 194869; // Obtain this from the url
// It will be like https://XYZ.stackexchange.com/questions/QUESTION_ID/... on any question page
var COMMENT_FILTER = "!)Q2B_A2kjfAiU78X(md6BoYk";
var OVERRIDE_USER = 8478; // This should be the user ID of the challenge author.

/* App */

return "https://api.stackexchange.com/2.2/questions/" +  QUESTION_ID + "/answers?page=" + index + "&pagesize=100&order=desc&sort=creation&site=codegolf&filter=" + ANSWER_FILTER;
}

}

jQuery.ajax({
method: "get",
dataType: "jsonp",
crossDomain: true,
success: function (data) {
data.items.forEach(function(a) {
});
comment_page = 1;
}
});
}

jQuery.ajax({
method: "get",
dataType: "jsonp",
crossDomain: true,
success: function (data) {
data.items.forEach(function(c) {
if (c.owner.user_id === OVERRIDE_USER)
});
else process();
}
});
}

var SCORE_REG = /<h\d>\s*([^\n,<]*(?:<(?:[^\n>]*>[^\n<]*<\/[^\n>]*>)[^\n,<]*)*),.*?(\d+)(?=[^\n\d<>]*(?:<(?:s>[^\n<>]*<\/s>|[^\n<>]+>)[^\n\d<>]*)*<\/h\d>)/;

function getAuthorName(a) {
return a.owner.display_name;
}

function process() {
var valid = [];

var body = a.body;
if(OVERRIDE_REG.test(c.body))
body = '<h1>' + c.body.replace(OVERRIDE_REG, '') + '</h1>';
});

var match = body.match(SCORE_REG);
if (match)
valid.push({
user: getAuthorName(a),
size: +match[2],
language: match[1],
});
else console.log(body);
});

valid.sort(function (a, b) {
var aB = a.size,
bB = b.size;
return aB - bB
});

var languages = {};
var place = 1;
var lastSize = null;
var lastPlace = 1;
valid.forEach(function (a) {
if (a.size != lastSize)
lastPlace = place;
lastSize = a.size;
++place;

.replace("{{NAME}}", a.user)
.replace("{{LANGUAGE}}", a.language)
.replace("{{SIZE}}", a.size)

var lang = a.language;
lang = jQuery('<a>'+lang+'</a>').text();

languages[lang] = languages[lang] || {lang: a.language, lang_raw: lang, user: a.user, size: a.size, link: a.link};
});

var langs = [];
for (var lang in languages)
if (languages.hasOwnProperty(lang))
langs.push(languages[lang]);

langs.sort(function (a, b) {
if (a.lang_raw.toLowerCase() > b.lang_raw.toLowerCase()) return 1;
if (a.lang_raw.toLowerCase() < b.lang_raw.toLowerCase()) return -1;
return 0;
});

for (var i = 0; i < langs.length; ++i)
{
var language = jQuery("#language-template").html();
var lang = langs[i];
language = language.replace("{{LANGUAGE}}", lang.lang)
.replace("{{NAME}}", lang.user)
.replace("{{SIZE}}", lang.size)
language = jQuery(language);
jQuery("#languages").append(language);
}

}
body {
text-align: left !important;
display: block !important;
}

width: 290px;
float: left;
}

#language-list {
width: 500px;
float: left;
}

font-weight: bold;
}

table td {
}
<script src="https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js"></script>
<div id="language-list">
<h2>Shortest Solution by Language</h2>
<table class="language-list">
<tr><td>Language</td><td>User</td><td>Score</td></tr>
<tbody id="languages">

</tbody>
</table>
</div>
<tr><td></td><td>Author</td><td>Language</td><td>Size</td></tr>

</tbody>
</table>
</div>
<table style="display: none">
</tbody>
</table>
<table style="display: none">
<tbody id="language-template">
</tbody>
</table>

• Did you mean String 1: "abcdef", String 2: "def" for the last test case? Oct 25 '19 at 21:28
• Test cases with repeating letters would also be good.
– xnor
Oct 25 '19 at 21:46
• Then, it's basically the same test case as the 2nd one. You should add one where the 1st alphabet is a superset of the 2nd. Oct 25 '19 at 22:10
• "Any valid unicode string could be an input." <-- if unicode support is mandatory, you should include some unicode test cases. (I have a feeling some existing answers will fail them.) Oct 26 '19 at 19:58
• Recommended test case: {"😀😁😆", "😀😁😆🀀", falsey} (Explanation: 😀 is F0 98 9F 80 in UTF-8, 🀀 is F0 9F 80 80 in UTF-8; If an answer is checking the UTF-8 bytes instead of characters, it will return truthy) Oct 27 '19 at 20:18

Python 3, 21 bytes

lambda a,b:{*a}>={*b}


Try it online!

Explanation

• Hi, can you explain your answer ? Dec 20 '19 at 12:17
• @DorianTurba Thanks for adding an explanation!
– xnor
Dec 22 '19 at 4:09

all.flip elem


Try it online!

Haskell doesn't have built-in set or subset functions, so we need to do it ourselves. This is a pointfree version of

17 bytes

a%b=all(elema)b


Try it online!

which it itself shortened from

22 bytes

a%b=and[elem c a|c<-b]


Try it online!

Regex (ECMAScript 2018 / Pythonregex / .NET), 20 bytes

Takes the two strings in joined format, delimited by a single newline. That is why there are two newlines in the regex itself (saving 2 bytes compared to if \n were used):


((.)(?<=\2.*
.*))*$ Try it online! - ECMAScript 2018 Try it online! - Python import regex Try it online! - .NET It just so happens that the order of String 1 and String 2 dictated by this question is the one that makes it a bit nontrivial in regex, impossible to do without variable-length lookbehind or non-atomic lookahead. If it were the other way around, it would be possible in vanilla ECMAScript. \n # 1. Find the newline, so we can match against String 2 ( # 2. Start loop at the beginning of String 2 (.) # 3. At every iteration, capture another character from String 2 into \2 (?<= # 4. positive lookbehind - look backwards \2.* # 6. Assert that the captured character \2 can be found in String 1 \n.* # 5. Find the newline, so we can match against String 1 ) )* # 7. Continue the loop as long as possible$          # 8. Assert that when the loop has finished, we've reached String 2's end


Regex (Java), 29 or 27 bytes

Java has a limited sort of variable-length lookbehind. It's unlimited in length, but there are strict limits as to what is allowed in a lookbehind (most notably, all backreferences must be inside a lookahead inside the lookbehind), and stricter limits on what will actually work in a lookbehind. So in principle it has the same power as full-fledged variable-length lookbehind in its ability to solve computation problems, but will do so less efficiently.

In this case, two limits come into play: \2 need to be backreferenced in a lookahead, and apparently, if an expression like .*x.* is in a lookbehind (where x is any character), it will silently fail to work properly. Here we work around this problem by collapsing the .*\n.* into [\s\S]*:


((.)(?<=^(?=.*\2)[\s\S]*))*$ 29 bytes - Try it online! This problem could also be solved by using comma as a delimiter instead of newline: ,((.)(?<=^(?=[^,]*\2).*))*$


27 bytes - Try it online!

Or by using the s (dotall) flag with newline as the delimiter:


((.)(?<=^(?=[^
]*\2).*))*$ 27 bytes - Try it online! Regex (PCRE1), 48 bytes + s flag It is possible to emulate variable-length lookbehind using recursive constant-width lookbehind:  ((.)((?<=(?= ((?<=(?=$.|\2|(?4)).))|(?3)).)))*$ Try it on regex101 (only takes one input at a time) The recursive lookbehind goes through two stages in this regex: first (?3) to find the newline, and then (?4) to find the captured character. The regex could be 1 byte shorter if some character that is guaranteed not to be present in the input were used as the dummy impossible match instead of $..

/s single line mode (dotall) is used so that newline can be the delimiter, with the . in the lookbehinds being allowed to match it. With any other choice of delimiter (even a control character), this flag would not be needed. Therefore, I have not included it in the byte count. FWIW though, keeping newline as the delimiter and not using /s mode would require upping the length to 52 bytes (with a regex that runs much more slowly, due to putting the newline after the lookbehind), costing the same in bytes as adding (?s) would, thus not worthwhile.

Regex (PCRE2 / Perl 5), 45 bytes + s flag

Same approach as PCRE1, but the dummy impossible match $. is no longer needed to avoid a "recursive call could loop indefinitely" error:  ((.)((?<=(?= ((?<=(?=\2|(?4)).))|(?3)).)))*$


Try it online! - PCRE2 (C++)
Try it online! - PCRE2 (PHP – doesn't work, and I don't know why)
Try it online! - Perl 5

Regex (PCRE2) length-limited, 39 38$$\+\lfloor log_{10}L_{max}\rfloor\$$ bytes

It is possible to emulate molecular lookbehind (and some of the power of variable-length lookbehind) using jaytea's lookahead quantification trick, but this limits the maximum possible length of String 2 to 1023 characters. In the linked blog post I commented (as Davidebyzero) on a way to extend this limit by a couple of orders of magnitude, but it nevertheless remains.

This trick does not work in Perl 5, because apparently it has the same "no empty optional" behavior as ECMAScript. [Edit: This isn't true in most circumstances. Needs to be looked into.]

1 byte can be saved by omitting the anchor. Any non-match will remain a non-match even if it is attempted from later positions in the first string, because if the second string isn't made up of a subset of the first string's characters, it certainly won't be made up of a smaller subset. This does result in a slowdown for non-matches.

((?=(?=.*
(\2?(.?))).*\3)){1,1023}?.*
\2$ Try it online! (C++) Try it online! (PHP) Regex (PCRE2) length-limited const, 36 35$$\+\lfloor log_{10}L_{max}\rfloor\$$ bytes The regex still works with a constant quantifier (for a total length of 39 bytes), but will take more steps (but not necessarily much more time, depending on the optimization done by the regex engine). ((?=(?=.* (\2?(.?))).*\3)){1149}.* \2$


Try it online! (C++)
Try it online! (PHP)

Regex (Perl 5 / .NET / Java) length-limited const, 34 33$$\+\lfloor log_{10}L_{max}\rfloor\$$ bytes

This version works in Perl, in which the quantifier can go up to {32766} (which would make a regex length of 40 bytes, and still execute fast), and in Java, in which the quantifier apparently can go up to {400000000165150719} (but must be much smaller for execution time to be practical).

PCRE1 (and PCRE2 earlier than v10.35), as well as Ruby, treat any quantifer greater than 1 on a lookaround as being 1, so the lookaround must be wrapped in a dummy group, costing 2 bytes. But in Perl 5, .NET, Java, and Python 3, lookarounds can be directly quantified:

(?=(?=.*
(\1?(.?))).*\2){9999}.*
\1$ Try it online! - Perl 5 Try it online! - .NET (C#) Try it online! - Java - 1 byte longer – needs the anchor for some reason – this needs investigation Regex (PCRE1) length-limited, {45 or 42 44 or 41}$$\+\lfloor log_{10}L_{max}\rfloor\$$ bytes Due to a fundamental flaw in PCRE1's design, a workaround is needed to prevent the regex from returning truthy when the last character of String 2 is not present in String 1: ((?=(?=.* (\2?(.?))).*\3.*( \2))){1,481}?.*\4$


Try it on regex101

The regex still works with a constant quantifier, but will take more steps (but not necessarily much more time, depending on the optimization done by the regex engine):

((?=(?=.*
(\2?(.?))).*\3.*(
\2))){500}.*\4$ Try it on regex101 Regex (Ruby) length-limited, 50 49$$\+\lfloor log_{10}L_{max}\rfloor\$$ bytes The lookahead quantification trick fully works in Ruby, and can go as high as {100000}. There is no support for nested backreferences, so \2 must be copied to \4 in a lookahead: ((?=(?=.* (\4?(.?))).*\3(?=.* (\2)))){1,100000}?.* \2$


Try it online!

While Ruby's regex engine does have subroutine calls, and thus at first glance it might appear to be possible to adapt the solutions that emulate variable-length lookbehind to it, it does not appear to be possible to do so. Any attempt at recursion with subroutine calls generates the error "never ending recursion", even when there are clear-cut terminating conditions.

Regex (Pythonregex) length-limited const, 44$$\+\lfloor log_{10}L_{max}\rfloor\$$ bytes

The lookahead quantification trick works in Python 3 (using the regex module rather than re), but only with a constant quantifier. This is a shame, because Python can go as high as {4294967294}, but increasing its value in this regex causes super-exponential slowdown. There is no support for nested backreferences, so just like the Ruby version, \2 must be copied to \4 in a lookahead.

(?=(?=.*
(\3?(.?))).*\2(?=.*
(\1))){300}.*
\1$ Try it online! Regex (RegexMathEngine-xml), 27 bytes In RegexMathEngine, molecular (non-atomic) lookahead can be used in the form of (?*...) when enabled using the -xml command line parameter ("enable extension: molecular lookahead"). This needs to be anchored because the delimiter is inside a negative lookahead, so without the anchor, a non-match could become a match by leapfrogging the delimiter and starting its match within the second string. ^(?!(?*.*,(.)+)(?!.*\1.*,))  Comma is the delimiter because it is not yet possible to work with strings containing newlines when using command-line invocation of this regex engine (which works as a one-line-at-a-time grep). Regex (PCRE2 v10.35), 27 24 bytes PCRE does not have variable-length lookbehinds, but PCRE2 v10.34 has introduced non-atomic lookarounds in the form of (*napla:...) and (*naplb:...) (with the added synonyms of (?*...) and (?<*...) in v10.35), making it also able to solve this problem in the general case. This is shorter than in RegexMathEngine thanks to the use of newline as a delimiter: ^(?!(?*.* (.)+)(?!.*\1))  Try it on regex101 Try it online! (C) (doesn't work yet because TIO still has only PCRE2 v10.33) Try it online! (PHP) (doesn't work yet because TIO still has only PCRE2 v10.33) You can change the delimiter (for example to comma: ^(?!(?*.*,(.)+)(?!.*\1.*,))), to test on the command line using pcre2grep. If the strings were in the other order: Regex (ECMAScript / Python), 19 bytes If String 2 comes before String 1, there is no need for lookbehind or non-atomic lookahead, and the solution is universal to all regex engines that have lookahead. It does now need to be anchored though, because otherwise, any non-match could become a match by discarding the beginning of the first string. ^((.)(?=.* .*\2))*  Try it online! - ECMAScript Try it online! - Python ^( # start loop at the beginning of String 2 (.) # at every iteration, capture another character from String 2 into \2 (?=.*\n # look ahead to String 1 (by finding the newline) .*\2 # assert that the captured character \2 can be found in String 1 ) )* # continue the loop as long as possible \n # assert that when the loop has finished, we've reached String 2's end  Python 3, 28 23 bytes lambda x,y:not{*y}-{*x}  Try it online! -5 bytes thanks to Wizzwizz4 28 bytes lambda x,y:not set(y)-set(x)  Try it online! Simply turns the two inputs into sets and subtracts the sets from each other • If you used {*y} syntax, you could remove that space for -5 bytes. Oct 26 '19 at 14:50 Brachylog, 3 bytes dp⊆  Try it online! Takes string 1 as the output variable and string 2 as the input variable. JavaScript (ES6), 31 bytes Takes arrays of characters as input. a=>b=>b.every(c=>a.includes(c))  Try it online! 25 bytes For the record, below is my original answer, which was designed for alphanumeric characters. a=>b=>!b.match([^${a}])


Try it online!

• Won't this fail if a contains a hyphen? e.g f("a-c")("abc") Oct 25 '19 at 22:35
• @Shaggy Yes, I overlooked the any valid unicode string part. Updated. Oct 25 '19 at 23:14

Gaia, 1 byte

⊃


Try it online!

Just a built-in. For strings, it checks for character-wise superset.

Test Suite

W, 2 bytes

Back then I definitely had the negation instruction. If you think it's boring then continue.

t!


Explanation

t  % Remove all characters of 1st input that appears in 2nd input.
% e.g. ['abcdef','abc'] -> 'def'
! % Negate the result. So if the resulting string had something,
% it will return falsy. Otherwise it will yield truthy.


W, 4 bytes

W is back, reimplemented!

t""=


If you want to specify your input and code, you look for imps.py and then re-set those variables like this:

read = ["abcabc","abc"]

prog = 't""='


Note that your inputs must be in a single array with the joined values.

Wren, 866030 26 bytes

I didn't expect this. Wren is very hard to golf.

Fn.new{|a,b|b.trim(a)==""}


Try it online!

Explanation

Fn.new{                    // New anonymous function
|a,b|               // With parameters a and b
b.trim(a)      // After removing all characters in a that are in b
// (If b can be assembled using a the result should
// be a null string; otherwise it should be a
// non-empty string.
==""} // Is this result an empty string?

• Fn.new{ ... } is a bit verbose (comparing to (vars)=>expression) but it looks so pretty. And the "meat" is quite small (just 18 bytes)! Oct 28 '19 at 16:56
• Never think of eating a wren. It is tiny and you can't get a lot of meat out of it despite of its attracting appearance.
– user85052
Oct 29 '19 at 14:25

APL (Dyalog Unicode), 3 bytes

×/∊


Try it online!

Use it as string2 f string1.

How it works

×/∊
∊  Does each char of string2 appear in string1?
×/   All of them?

• Switch to dzaima/APL and save a byte: ∧∊ Try it online!
Nov 3 '19 at 13:46

Ruby, 21 bytes

->x,y{!y.tr(x,"")[0]}


The tr method replaces all instances of the first string it's passed with the corresponding character in the second string it's passed. So all characters from x are removed from y. If there are any characters left, then it returns the first value (all values are truthy in ruby except false and nil) and inverses it. And if there are no characters left, then nil is inversed.

Golfy Tricks Implemented:

• Using y.tr(x,"") instead of y.chars-x.chars
• Using !array[0] instead of array.empty?

Try it online!

• Similar 20 byte answer. These both technically fail though because tr and count will do the wrong thing if ^ or - show up in the wrong place. Dec 30 '19 at 22:05

J, 5 bytes

*/@e.


Try it online!

Is each char of the 2nd string an element of e. the 1st string? This returns a boolean mask, whose elements we multiply together with */. J is smart about 0 values so that if you apply */ to the empty list '' you get 1.

J, 6 bytes

''-:-.


Try it online!

Does the empty string '' match -: 1st string "set minused" -. from the 2nd?

Japt-!, 1510 5 bytes

k@VøX


Try it online!

Thanks to @Shaggy for -5.

• Welcome to Japt! Oct 25 '19 at 22:26
• 6 bytes, using the -! flag. Oct 25 '19 at 22:31
• Or maybe 5 bytes Oct 25 '19 at 22:33
• Oct 25 '19 at 23:46
• Oct 25 '19 at 23:48

C (gcc), 94 85 bytes

f(a,b,c)int*a,*b,*c;{for(;*b;++b){for(c=a;*c&&*c!=*b;++c);if(!*c)return 0;}return 1;}


Try it online!

-9 bytes from JL2210

Returns int: 1 for truthy and 0 for falsey.

Note: takes two parameters that are each pointers to null-terminated wide strings (wchar_t are the same size as int on the platform used on TIO, so we can take the strings as int* instead of including wchar.h and taking them as wchar_t*)

Explanation/Ungolfed:

#include <wchar.h>
int f(const wchar_t *a, const wchar_t *b) {
for ( ; *b != L'\0'; ++b) { // For each character in the second string
const wchar_t *temp;
for (temp = a; *temp != L'\0'; ++temp) {
if (*temp == *b) break;
// If the character is in the first string,
// then continue and check the next character
}
if (*temp == L'\0') return 0;
}
return 1; // If every character was found, return 1 (truthy)
}

• 85 bytes Oct 27 '19 at 23:25
• 78 bytes Oct 28 '19 at 5:58
• @ceilingcat 74 bytes by replacing last return with a= Jan 21 '20 at 22:12

PHP (7.4), 2625 28 bytes

fn($a,$b)=>''>=strtok($b,$a)


Try it online!

PHP's strtok, basically removes characters of its second parameter, form its first parameter and returns the result or false if the result is empty. By removing $a characters from $b, if the result is empty (false), we output a truthy, else a falsy.

Christoph mentioned an issue with output of '0' from strtok (which equals to false), and to solve it, ''>= is used instead of a simple NOT (!) at a cost of +3 bytes. ''== would work the same way as well.

• Alternativelly, for PHP 4.1.2 and older, you can use <?=!strtok($b,$a); (18 bytes) directly, where the short_open_tag and register_globals default to 1 (enabled). For this, a POST/GET/COOKIE/SESSION would need to have the keys a and b set. Oct 28 '19 at 16:51
• @IsmaelMiguel I prefer to forget register globals and old PHP versions. You can post it as a separate answer though. Oct 28 '19 at 17:02
• No, thanks. Was just posting it as a reminder that PHP used to be a lot worse. Oct 28 '19 at 17:43
• Sadly this doesn't work correctly e.g. 'abc', 'abc0a123'. strtok returns '0' which will then be transformed to true. Jan 23 '20 at 13:56
• @Christoph Thanks, fixed. Jan 24 '20 at 17:17

Pyth, 7 bytes

g.{w.{w


Try it online!

First string on first line of input, second string on second line.

• I'm pretty sure !-E works. Oct 25 '19 at 21:54
• Submit it separately then, you'll deserve any upvotes you get for it. Oct 25 '19 at 22:02
• Also 7 bytes Feb 13 at 0:39

Bracmat, 51 bytes

(f=a b.!arg:(?a,?b)&vap$((=.@(!a:? !arg ?)&|F).!b))  The function f returns a list of Fs, one F for each character in b that is not in a's alphabet. An empty list means that b's alphabet is contained in a's alphabet. The function vap splits the second argument, which must be a string, in UTF-8 encoded characters if the second argument (!b in this case) is valid UTF-8, and otherwise in bytes. Try it online! Lua, 75 bytes load'b,a=...return a:gsub(".",load"return not b:find(...,1,1)and [[]]")==a'  Try it online! Now this is a bit messy. load is used to create function here, so everything inside is its body. Here, after taking input, following transformation is done: every symbol in second string is checked in first one. If it is found, internal function return false and no replacement is done. Otherwise, symbol is removed (replaced with empty string). Resulting string is compared with one passed as input, efficiently checking that no deletions were performed. TIO link also include test cases. • awesome golfing – LMD Oct 28 '19 at 18:17 CJam, 5 bytes ll\-!  Try it online! Test Suite Explanation ll Read 2 lines of input \ Swap their order - Remove from the second input all characters in the first ! Negate  MATL, 3 bytes wmA  Explanation The code implicitly takes two strings as inputs, swaps them, and verifies if All the characters in the first string (originally the second input) are members of the other string. (A non-empty array containing exclusively ones is truthy in MATL. This would allow omitting A if it wasn't for the case with empty inputs). Kotlin, 35 bytes {a,b->(b.toSet()-a.toSet()).none()}  Try it online! PowerShell, 34 bytes param($a,$b)0-notin($b|%{$_-in$a})


Try it online!

Takes two arrays of chars as input.

K (ngn/k), 5 bytes

~^&/?


Try it online!

A tacit function taking two arguments.

• ? find the indices of the first matches of the right-hand argument in the left-hand argument; returns 0N (null) if it's not present
• &/ take the minimum
• ~^ is the minimum not null?

Whispers v1, 50 43 bytes

> Input
> Input
>> {2}
>> 3⊆1
>> Output 4


Try it online!

Squeezed pseudo code:

>> Output ( Set(Input2) ⊆ Input 1)


Explanation:

As always in Whispers, we execute the last line first:

>> Output 4


Outputs the result of line 4:

>> 3⊆1


Returns a Boolean representing the result of line 3 being a subset of the result of line 1. Let's evaluate line 1 first:

>> Input


Takes the first line of the input.

Now line 3:

>> {2}


This line forms the set of the result of line 2, which takes the next line of input.

So we get the squashed pseudocode:

>> Output ( Set(Input2) ⊆ Input 1)


x86-16 machine code, 14 bytes

00000000: 85c9 ac57 518b caf2 ae59 5fe1 f5c3       ...WQ....Y_...


Listing:

85 C9       TEST CX, CX         ; check for empty string
S_LOOP:
AC          LODSB               ; next char in string 2
57          PUSH DI             ; save first string pointer
51          PUSH CX             ; save first string length
8B CA       MOV  CX, DX         ; put first string length into scan counter
F2 AE       REPNZ SCASB         ; compare string 2 char to each in string 1 until match
59          POP  CX             ; restore first string length
5F          POP  DI             ; restore first string pointer
E1 F5       LOOPZ S_LOOP        ; loop until end of second string OR no matches


Callable function - input string 1 at [DI] length in DX, string 2 at [SI] length in CX. Output ZF if Truthy, NZ if Falsy.

Programming note: if input string 2 is empty, it will (harmlessly) loop 65,535 times in order to correctly return ZF. This is because LOOPcc decrements before testing for 0 so it must wrap around the 16-bit counter register before reaching 0 again. Otherwise a JZ or JCXZ after the TEST would eliminate this at a cost of +2 bytes, but hey, this is Code Golf not Efficiency Golf.

Tests:

Try it online!

Charcoal, 5 bytes

⬤η№θι


Try it online! Link is to verbose version of code. Outputs a Charcoal boolean, i.e. - for true, nothing for false. Explanation:

⬤       All of
η      Second string
№     Count (is non-zero) in
θ    First string of
ι   Character of second string
Implicitly print


Zsh, 35 bytes

a=(${(s::)1}) ((!${#${(s::)2}:|a}))  Try it online! ${(s::)2}        # split second parameter into characters
${ :|a} # remove all elements of$a
${# } # count ((! )) # return truthy if 0, falsy if non-zero  Perl 5, 53 bytes sub{local$_=pop;eval"y/@{[quotemeta pop]}//d";!y///c}


Try it online!

Jelly, 3 bytes

fƑ@


Try it online!

A dyadic link taking two strings and returning a Boolean. If the order of the input s can be reversed, I could save one byte.

Works by checking whether the second string is unchanged when filtering to just the characters in the first.

• The OP has now said that the input order cannot be reversed :-/ Oct 26 '19 at 10:01

f a b=all(\c->elem c a)b


Try it online!

Japt-!, 3 bytes

VkU


Try it

VkU   U = first string, V = second
Vk    Remove all characters in V
U   that are present in U
-!    If the string is empty, return true, else false