--- title: Count occurrences of a substring id: 596fda99c69f779975a1b67d challengeType: 5 forumTopicId: 302237 --- ## Description
Create a function, or show a built-in function, to count the number of non-overlapping occurrences of a substring inside a string. The function should take two arguments: It should return an integer count. The matching should yield the highest number of non-overlapping matches. In general, this essentially means matching from left-to-right or right-to-left.
## Instructions
## Tests
```yml tests: - text: countSubstring should be a function. testString: assert(typeof countSubstring === 'function'); - text: countSubstring("the three truths", "th") should return 3. testString: assert.equal(countSubstring(testCases[0], searchString[0]), results[0]); - text: countSubstring("ababababab", "abab") should return 2. testString: assert.equal(countSubstring(testCases[1], searchString[1]), results[1]); - text: countSubstring("abaabba*bbaba*bbab", "a*b") should return 2. testString: assert.equal(countSubstring(testCases[2], searchString[2]), results[2]); ```
## Challenge Seed
```js function countSubstring(str, subStr) { return true; } ```
### After Test
```js const testCases = ['the three truths', 'ababababab', 'abaabba*bbaba*bbab']; const searchString = ['th', 'abab', 'a*b']; const results = [3, 2, 2]; ```
## Solution
```js function countSubstring(str, subStr) { const escapedSubStr = subStr.replace(/[.+*?^$[\]{}()|/]/g, '\\$&'); const matches = str.match(new RegExp(escapedSubStr, 'g')); return matches ? matches.length : 0; } ```