2018-09-30 23:01:58 +01:00
---
title: ABC Problem
id: 594810f028c0303b75339acc
challengeType: 5
2019-08-05 09:17:33 -07:00
forumTopicId: 302220
2018-09-30 23:01:58 +01:00
---
## Description
< section id = 'description' >
2019-02-24 19:04:29 +09:00
You are given a collection of ABC blocks (e.g., childhood alphabet blocks). There are 20 blocks with two letters on each block. A complete alphabet is guaranteed amongst all sides of the blocks. The sample collection of blocks:
< pre >
(B O)
(X K)
(D Q)
(C P)
(N A)
(G T)
(R E)
(T G)
(Q D)
(F S)
(J W)
(H U)
(V I)
(A N)
(O B)
(E R)
(F S)
(L Y)
(P C)
(Z M)
< / pre >
2018-09-30 23:01:58 +01:00
< / section >
## Instructions
< section id = 'instructions' >
2019-03-01 17:10:50 +09:00
Implement a function that takes a string (word) and determines whether the word can be spelled with the given collection of blocks.
Some rules to keep in mind:
< ul >
< li > Once a letter on a block is used, that block cannot be used again.< / li >
< li > The function should be case-insensitive.< / li >
< / ul >
2018-09-30 23:01:58 +01:00
< / section >
## Tests
< section id = 'tests' >
```yml
2018-10-04 14:37:37 +01:00
tests:
2019-11-20 07:01:31 -08:00
- text: < code > canMakeWord</ code > should be a function.
2019-07-26 05:24:52 -07:00
testString: assert(typeof canMakeWord === 'function');
2018-10-04 14:37:37 +01:00
- text: < code > canMakeWord</ code > should return a boolean.
2019-07-26 05:24:52 -07:00
testString: assert(typeof canMakeWord('hi') === 'boolean');
2018-10-04 14:37:37 +01:00
- text: < code > canMakeWord("bark")</ code > should return true.
2019-07-26 05:24:52 -07:00
testString: assert(canMakeWord(words[0]));
2018-10-04 14:37:37 +01:00
- text: < code > canMakeWord("BooK")</ code > should return false.
2019-07-26 05:24:52 -07:00
testString: assert(!canMakeWord(words[1]));
2018-10-04 14:37:37 +01:00
- text: < code > canMakeWord("TReAT")</ code > should return true.
2019-07-26 05:24:52 -07:00
testString: assert(canMakeWord(words[2]));
2018-10-04 14:37:37 +01:00
- text: < code > canMakeWord("COMMON")</ code > should return false.
2019-07-26 05:24:52 -07:00
testString: assert(!canMakeWord(words[3]));
2018-10-04 14:37:37 +01:00
- text: < code > canMakeWord("squAD")</ code > should return true.
2019-07-26 05:24:52 -07:00
testString: assert(canMakeWord(words[4]));
2018-10-04 14:37:37 +01:00
- text: < code > canMakeWord("conFUSE")</ code > should return true.
2019-07-26 05:24:52 -07:00
testString: assert(canMakeWord(words[5]));
2018-09-30 23:01:58 +01:00
```
< / section >
## Challenge Seed
< section id = 'challengeSeed' >
< div id = 'js-seed' >
```js
2019-02-24 19:04:29 +09:00
function canMakeWord(word) {
2018-09-30 23:01:58 +01:00
// Good luck!
}
```
< / div >
### After Test
< div id = 'js-teardown' >
```js
2018-10-20 21:02:47 +03:00
const words = ['bark', 'BooK', 'TReAT', 'COMMON', 'squAD', 'conFUSE'];
2018-09-30 23:01:58 +01:00
```
< / div >
< / section >
## Solution
< section id = 'solution' >
```js
2019-02-26 17:07:07 +09:00
function canMakeWord(word) {
2018-09-30 23:01:58 +01:00
const characters = 'BO XK DQ CP NA GT RE TG QD FS JW HU VI AN OB ER FS LY PC ZM';
2018-10-02 15:02:53 +01:00
const blocks = characters.split(' ').map(pair => pair.split(''));
2018-09-30 23:01:58 +01:00
const letters = [...word.toUpperCase()];
let length = letters.length;
const copy = new Set(blocks);
letters.forEach(letter => {
for (let block of copy) {
const index = block.indexOf(letter);
if (index !== -1) {
length--;
copy.delete(block);
break;
}
}
});
return !length;
}
```
< / section >