More declarative solution to "Mutations Algorithm"

I found a cleaner, simpler, more declarative solution that I didn’t see anywhere so I thought I would post it here:

function mutation(arr) {
  const target = arr[0].toLowerCase().split('');
  const test   = arr[1].toLowerCase().split('');
  return test.every(letter => target.includes(letter))

Hello there.

Thank you, for your contribution. For future contributions, please wrap your solution within :

code goes here...

Also, provide all of the necessary code to pass the challenge.

Also, when you enter a code block into a forum post, please precede it with a separate line of three backticks and follow it with a separate line of three backticks to make it easier to read.

You can also use the “preformatted text” tool in the editor ( </> ) to add backticks around text.

See this post to find the backtick on your keyboard.
Note: Backticks (`) are not single quotes (’).

This topic was automatically closed 182 days after the last reply. New replies are no longer allowed.