---
id: 587d7db6367417b2b2512b9b
title: Find Characters with Lazy Matching
challengeType: 1
---
## Description
In regular expressions, a greedy match finds the longest possible part of a string that fits the regex pattern and returns it as a match. The alternative is called a lazy match, which finds the smallest possible part of the string that satisfies the regex pattern.
You can apply the regex /t[a-z]*i/ to the string "titanic". This regex is basically a pattern that starts with t, ends with i, and has some letters in between.
Regular expressions are by default greedy, so the match would return ["titani"]. It finds the largest sub-string possible to fit the pattern.
However, you can use the ? character to change it to lazy matching. "titanic" matched against the adjusted regex of /t[a-z]*?i/ returns ["ti"].
## Instructions
Fix the regex /<.*>/ to return the HTML tag <h1> and not the text "<h1>Winter is coming</h1>". Remember the wildcard . in a regular expression matches any character.
## Tests
```yml
tests:
- text: The result variable should be an array with <h1> in it
testString: 'assert(result[0] == "", "The result variable should be an array with <h1> in it");'
```
## Challenge Seed
```js
let text = "
Winter is coming
";
let myRegex = /<.*>/; // Change this line
let result = text.match(myRegex);
```
## Solution
```js
// solution required
```