2.4 KiB
2.4 KiB
id | title | challengeType |
---|---|---|
587d7db6367417b2b2512b99 | Match Characters that Occur One or More Times | 1 |
Description
+
character to check if that is the case. Remember, the character or pattern has to be present consecutively. That is, the character has to repeat one after the other.
For example, /a+/g
would find one match in "abc"
and return ["a"]
. Because of the +
, it would also find a single match in "aabc"
and return ["aa"]
.
If it were instead checking the string "abab"
, it would find two matches and return ["a", "a"]
because the a
characters are not in a row - there is a b
between them. Finally, since there is no "a"
in the string "bcd"
, it wouldn't find a match.
Instructions
s
occurs one or more times in "Mississippi"
. Write a regex that uses the +
sign.
Tests
tests:
- text: Your regex <code>myRegex</code> should use the <code>+</code> sign to match one or more <code>s</code> characters.
testString: assert(/\+/.test(myRegex.source), 'Your regex <code>myRegex</code> should use the <code>+</code> sign to match one or more <code>s</code> characters.');
- text: Your regex <code>myRegex</code> should match 2 items.
testString: assert(result.length == 2, 'Your regex <code>myRegex</code> should match 2 items.');
- text: The <code>result</code> variable should be an array with two matches of <code>"ss"</code>
testString: assert(result[0] == 'ss' && result[1] == 'ss', 'The <code>result</code> variable should be an array with two matches of <code>"ss"</code>');
Challenge Seed
let difficultSpelling = "Mississippi";
let myRegex = /change/; // Change this line
let result = difficultSpelling.match(myRegex);
Solution
let difficultSpelling = "Mississippi";
let myRegex = /s+/g; // Change this line
let result = difficultSpelling.match(myRegex);