* chore(learn): audit basic algorithm scripting * chore(learn): audit basic data structures * chore(learn): audit basic javascript * chore(learn): audit debugging * chore(learn): audit es6 * chore(learn): audit functional programming * chore(learn): audit intermidate algorithms * chore(learn): audit js projects * chore(learn): audit object oriented programming * chore(learn): audit regex * fix(learn): remove stray . * fix(learn): string to code * fix(learn): missed some * fix(learn): clarify strings Based on Randy's feedback, clarifies string instances where quotes were removed in favour of back ticks. * fix: apply suggestions - thanks Randy! :) Co-authored-by: Randell Dawson <5313213+RandellDawson@users.noreply.github.com> * fix: non-suggestion comments * chore(learn): remove comments from codes Removes the comments from the description and instruction code blocks to ensure that all relevant information is translatable. * fix: Apply suggestions from code review Co-authored-by: Shaun Hamilton <51722130+ShaunSHamilton@users.noreply.github.com> * fix: revert crowdin fix * Update curriculum/challenges/english/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/mutations.md Co-authored-by: Randell Dawson <5313213+RandellDawson@users.noreply.github.com> * fix: Apply suggestions from code review Co-authored-by: Shaun Hamilton <51722130+ShaunSHamilton@users.noreply.github.com> * Update curriculum/challenges/english/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-assign-variables-from-arrays.md Co-authored-by: Shaun Hamilton <51722130+ShaunSHamilton@users.noreply.github.com> * fix: Apply suggestions from code review Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com> Co-authored-by: Shaun Hamilton <51722130+ShaunSHamilton@users.noreply.github.com> * chore: change voice * fix: Christopher Nolan * fix: expressions would evaluate * fix: will -> would * Update curriculum/challenges/english/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md Co-authored-by: Randell Dawson <5313213+RandellDawson@users.noreply.github.com> * fix: to work to push * Update curriculum/challenges/english/02-javascript-algorithms-and-data-structures/basic-javascript/iterate-with-javascript-for-loops.md Co-authored-by: Shaun Hamilton <51722130+ShaunSHamilton@users.noreply.github.com> * Update curriculum/challenges/english/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md Co-authored-by: Randell Dawson <5313213+RandellDawson@users.noreply.github.com> Co-authored-by: Randell Dawson <5313213+RandellDawson@users.noreply.github.com> Co-authored-by: Shaun Hamilton <51722130+ShaunSHamilton@users.noreply.github.com> Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
94 lines
2.0 KiB
Markdown
94 lines
2.0 KiB
Markdown
---
|
|
id: 587d7db9367417b2b2512ba6
|
|
title: Specify Only the Lower Number of Matches
|
|
challengeType: 1
|
|
forumTopicId: 301366
|
|
dashedName: specify-only-the-lower-number-of-matches
|
|
---
|
|
|
|
# --description--
|
|
|
|
You can specify the lower and upper number of patterns with quantity specifiers using curly brackets. Sometimes you only want to specify the lower number of patterns with no upper limit.
|
|
|
|
To only specify the lower number of patterns, keep the first number followed by a comma.
|
|
|
|
For example, to match only the string `hah` with the letter `a` appearing at least `3` times, your regex would be `/ha{3,}h/`.
|
|
|
|
```js
|
|
let A4 = "haaaah";
|
|
let A2 = "haah";
|
|
let A100 = "h" + "a".repeat(100) + "h";
|
|
let multipleA = /ha{3,}h/;
|
|
multipleA.test(A4);
|
|
multipleA.test(A2);
|
|
multipleA.test(A100);
|
|
```
|
|
|
|
In order, the three `test` calls would return `true`, `false`, and `true`.
|
|
|
|
# --instructions--
|
|
|
|
Change the regex `haRegex` to match the word `Hazzah` only when it has four or more letter `z`'s.
|
|
|
|
# --hints--
|
|
|
|
Your regex should use curly brackets.
|
|
|
|
```js
|
|
assert(haRegex.source.match(/{.*?}/).length > 0);
|
|
```
|
|
|
|
Your regex should not match the string `Hazzah`
|
|
|
|
```js
|
|
assert(!haRegex.test('Hazzah'));
|
|
```
|
|
|
|
Your regex should not match the string `Hazzzah`
|
|
|
|
```js
|
|
assert(!haRegex.test('Hazzzah'));
|
|
```
|
|
|
|
Your regex should match the string `Hazzzzah`
|
|
|
|
```js
|
|
assert('Hazzzzah'.match(haRegex)[0].length === 8);
|
|
```
|
|
|
|
Your regex should match the string `Hazzzzzah`
|
|
|
|
```js
|
|
assert('Hazzzzzah'.match(haRegex)[0].length === 9);
|
|
```
|
|
|
|
Your regex should match the string `Hazzzzzzah`
|
|
|
|
```js
|
|
assert('Hazzzzzzah'.match(haRegex)[0].length === 10);
|
|
```
|
|
|
|
Your regex should match the string `Hazzah` with 30 `z`'s in it.
|
|
|
|
```js
|
|
assert('Hazzzzzzzzzzzzzzzzzzzzzzzzzzzzzzah'.match(haRegex)[0].length === 34);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
let haStr = "Hazzzzah";
|
|
let haRegex = /change/; // Change this line
|
|
let result = haRegex.test(haStr);
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
let haStr = "Hazzzzah";
|
|
let haRegex = /Haz{4,}ah/; // Change this line
|
|
let result = haRegex.test(haStr);
|
|
```
|